( en | de | ru )

 

Disambiguation of "Itsykson, Dmitry"

Author of the publication

copydeleteadd this publication to your clipboard
Automating OBDD proofs is NP-hard.

, and . MFCS, volume 241 of LIPIcs, page 59:1-59:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Dmitry Sveshnikov

Dmitry Suslov

Dmitry Varentsov

Dmitry Chigrin

Dmitry Shvedov

 

Other publications of authors with the same name

Exponential Lower Bounds for the Running Time of DPLL Algorithms on Satisfiable Formulas., , and . ICALP, volume 3142 of Lecture Notes in Computer Science, page 84-96. Springer, (2004)Complexity of Distributions and Average-Case Hardness., , and . ISAAC, volume 64 of LIPIcs, page 38:1-38:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Structural complexity of AvgBPP.. Ann. Pure Appl. Log., 162 (3): 213-223 (2010)Computational and Proof Complexity of Partial String Avoidability., , and . MFCS, volume 58 of LIPIcs, page 51:1-51:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Hard Satisfiable Formulas for Splittings by Linear Combinations., and . SAT, volume 10491 of Lecture Notes in Computer Science, page 53-61. Springer, (2017)On Tseitin Formulas, Read-Once Branching Programs and Treewidth., and . CSR, volume 11532 of Lecture Notes in Computer Science, page 143-155. Springer, (2019)Lower Bounds for Splittings by Linear Combinations., and . MFCS (2), volume 8635 of Lecture Notes in Computer Science, page 372-383. Springer, (2014)Heuristic Time Hierarchies via Hierarchies for Sampling Distributions., , and . ISAAC, volume 9472 of Lecture Notes in Computer Science, page 201-211. Springer, (2015)Structural complexity of AvgBPP.. Electron. Colloquium Comput. Complex., (2008)Tight Bounds for Tseitin Formulas., , and . SAT, volume 236 of LIPIcs, page 6:1-6:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)