Selected papers from: Russian Workshop on Complexity and Model Theory 2019
A special issue of Algorithms (ISSN 1999-4893).
Deadline for manuscript submissions: closed (30 September 2019) | Viewed by 313
Special Issue Editors
Interests: combinatorics; probability; graph theory; discrete geometry
Interests: graph theory; random graphs; first order logic; descriptive complexity; extremal combinatorics
Special Issue Information
Dear Colleagues,
The Special Issue is related to the Russian Workshop on Complexity and Model Theory, held at the Moscow Institute of Physics and Technology (Russia, Dolgoprudny, Moscow Region), 9–11 June 2019. The aim of the workshop is to bring together specialists in computational complexity, communication complexity, formal languages, descriptive complexity, cryptography, and other related fields. The Special Issue will be based on extended versions of contributions presented at the workshop, but papers not presented there are also welcome. In both cases, the results should be new and should not be published in any other journal. Contributions arising from workshop abstracts should be substantially extended. All articles will be thoroughly refereed according to the high standards of Algorithms.
Prof. Dr. Andrei Raigorodskii
Dr. Maksim Zhukovskii
Guest Editors
Manuscript Submission Information
Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. All submissions that pass pre-check are peer-reviewed. Accepted papers will be published continuously in the journal (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as short communications are invited. For planned papers, a title and short abstract (about 100 words) can be sent to the Editorial Office for announcement on this website.
Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are thoroughly refereed through a single-blind peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Algorithms is an international peer-reviewed open access monthly journal published by MDPI.
Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 1600 CHF (Swiss Francs). Submitted papers should be well formatted and use good English. Authors may use MDPI's English editing service prior to publication or during author revisions.
Keywords
- Communication complexity
- Descriptive complexity
- Model theory
- Algebraic complexity
- Computational complexity
- First order logic
- Higher order logics
- Circuit complexity
- Cryptography
Benefits of Publishing in a Special Issue
- Ease of navigation: Grouping papers by topic helps scholars navigate broad scope journals more efficiently.
- Greater discoverability: Special Issues support the reach and impact of scientific research. Articles in Special Issues are more discoverable and cited more frequently.
- Expansion of research network: Special Issues facilitate connections among authors, fostering scientific collaborations.
- External promotion: Articles in Special Issues are often promoted through the journal's social media, increasing their visibility.
- e-Book format: Special Issues with more than 10 articles can be published as dedicated e-books, ensuring wide and rapid dissemination.
Further information on MDPI's Special Issue polices can be found here.
