default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Exact matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 63 matches
- 2024
- Dmitry Itsykson, Sergei Ovcharov:
On Limits of Symbolic Approach to SAT Solving. SAT 2024: 19:1-19:22 - Klim Efremenko, Michal Garlík, Dmitry Itsykson:
Lower Bounds for Regular Resolution over Parities. STOC 2024: 640-651 - Yaroslav Alekseev, Dmitry Itsykson:
Lifting to regular resolution over parities via games. Electron. Colloquium Comput. Complex. TR24 (2024) - 2023
- Nicola Galesi, Dmitry Itsykson, Artur Riazanov, Anastasia Sofronova:
Bounded-depth Frege complexity of Tseitin formulas for all graphs. Ann. Pure Appl. Log. 174(1): 103166 (2023) - Klim Efremenko, Michal Garlík, Dmitry Itsykson:
Lower bounds for regular resolution over parities. Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- Dmitry Itsykson, Artur Riazanov:
Automating OBDD proofs is NP-hard. MFCS 2022: 59:1-59:15 - Dmitry Itsykson, Artur Riazanov, Petr Smirnov:
Tight Bounds for Tseitin Formulas. SAT 2022: 6:1-6:21 - Dmitry Itsykson, Artur Riazanov:
Automating OBDD proofs is NP-hard. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- Dmitry Itsykson, Artur Riazanov, Danil Sagunov, Petr Smirnov:
Near-Optimal Lower Bounds on Regular Resolution Refutations of Tseitin Formulas for All Constant-Degree Graphs. Comput. Complex. 30(2): 13 (2021) - Dmitry Itsykson, Artur Riazanov, Danil Sagunov, Petr Smirnov:
Correction to: Near-Optimal Lower Bounds on Regular Resolution Refutations of Tseitin Formulas for All Constant-Degree Graphs. Comput. Complex. 30(2): 16 (2021) - Ludmila Glinskih, Dmitry Itsykson:
On Tseitin Formulas, Read-Once Branching Programs and Treewidth. Theory Comput. Syst. 65(3): 613-633 (2021) - Sam Buss, Dmitry Itsykson, Alexander Knop, Artur Riazanov, Dmitry Sokolov:
Lower Bounds on OBDD Proofs with Several Orders. ACM Trans. Comput. Log. 22(4): 26:1-26:30 (2021) - Dmitry Itsykson, Alexander Okhotin, Vsevolod Oparin:
Computational and Proof Complexity of Partial String Avoidability. ACM Trans. Comput. Theory 13(1): 6:1-6:25 (2021) - Dmitry Itsykson, Artur Riazanov:
Proof Complexity of Natural Formulas via Communication Arguments. CCC 2021: 3:1-3:34 - 2020
- Dmitry Itsykson, Dmitry Sokolov:
Resolution over linear equations modulo two. Ann. Pure Appl. Log. 171(1) (2020) - Dmitry Itsykson, Alexander Knop, Andrei E. Romashchenko, Dmitry Sokolov:
On OBDD-based Algorithms and Proof Systems that Dynamically Change the order of Variables. J. Symb. Log. 85(2): 632-670 (2020) - Sam Buss, Dmitry Itsykson, Alexander Knop, Artur Riazanov, Dmitry Sokolov:
Lower Bounds on OBDD Proofs with Several Orders. Electron. Colloquium Comput. Complex. TR20 (2020) - Dmitry Itsykson, Alexander Okhotin, Vsevolod Oparin:
Computational and proof complexity of partial string avoidability. Electron. Colloquium Comput. Complex. TR20 (2020) - Dmitry Itsykson, Artur Riazanov:
Proof complexity of natural formulas via communication arguments. Electron. Colloquium Comput. Complex. TR20 (2020) - 2019
- Ludmila Glinskih, Dmitry Itsykson:
On Tseitin Formulas, Read-Once Branching Programs and Treewidth. CSR 2019: 143-155 - Nicola Galesi, Dmitry Itsykson, Artur Riazanov, Anastasia Sofronova:
Bounded-Depth Frege Complexity of Tseitin Formulas for All Graphs. MFCS 2019: 49:1-49:15 - Nicola Galesi, Dmitry Itsykson, Artur Riazanov, Anastasia Sofronova:
Bounded-depth Frege complexity of Tseitin formulas for all graphs. Electron. Colloquium Comput. Complex. TR19 (2019) - Ludmila Glinskih, Dmitry Itsykson:
On Tseitin formulas, read-once branching programs and treewidth. Electron. Colloquium Comput. Complex. TR19 (2019) - Dmitry Itsykson, Alexander Knop, Andrei E. Romashchenko, Dmitry Sokolov:
On OBDD-based algorithms and proof systems that dynamically change order of variables. Electron. Colloquium Comput. Complex. TR19 (2019) - Dmitry Itsykson, Artur Riazanov, Danil Sagunov, Petr Smirnov:
Almost Tight Lower Bounds on Regular Resolution Refutations of Tseitin Formulas for All Constant-Degree Graphs. Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- Sam Buss, Dmitry Itsykson, Alexander Knop, Dmitry Sokolov:
Reordering Rule Makes OBDD Proof Systems Stronger. CCC 2018: 16:1-16:24 - Sam Buss, Dmitry Itsykson, Alexander Knop, Dmitry Sokolov:
Reordering Rule Makes OBDD Proof Systems Stronger. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- Ludmila Glinskih, Dmitry Itsykson:
Satisfiable Tseitin Formulas Are Hard for Nondeterministic Read-Once Branching Programs. MFCS 2017: 26:1-26:12 - Dmitry Itsykson, Alexander Knop:
Hard Satisfiable Formulas for Splittings by Linear Combinations. SAT 2017: 53-61 - Dmitry Itsykson, Alexander Knop, Andrei E. Romashchenko, Dmitry Sokolov:
On OBDD-Based Algorithms and Proof Systems That Dynamically Change Order of Variables. STACS 2017: 43:1-43:14
skipping 33 more matches
loading more results
failed to load more results, please try again later
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-09-23 02:02 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint