( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Lower Bounds for Splittings by Linear Combinations.

, и . MFCS (2), том 8635 из Lecture Notes in Computer Science, стр. 372-383. Springer, (2014)

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.

Dmitry Sveshnikov

Dmitry Suslov

Dmitry Varentsov

Dmitry Chigrin

Dmitry Shvedov

 

Другие публикации лиц с тем же именем

Exponential Lower Bounds for the Running Time of DPLL Algorithms on Satisfiable Formulas., , и . ICALP, том 3142 из Lecture Notes in Computer Science, стр. 84-96. Springer, (2004)Complexity of Distributions and Average-Case Hardness., , и . ISAAC, том 64 из LIPIcs, стр. 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., , и . MFCS, том 58 из LIPIcs, стр. 51:1-51:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Hard Satisfiable Formulas for Splittings by Linear Combinations., и . SAT, том 10491 из Lecture Notes in Computer Science, стр. 53-61. Springer, (2017)On Tseitin Formulas, Read-Once Branching Programs and Treewidth., и . CSR, том 11532 из Lecture Notes in Computer Science, стр. 143-155. Springer, (2019)Lower Bounds for Splittings by Linear Combinations., и . MFCS (2), том 8635 из Lecture Notes in Computer Science, стр. 372-383. Springer, (2014)Heuristic Time Hierarchies via Hierarchies for Sampling Distributions., , и . ISAAC, том 9472 из Lecture Notes in Computer Science, стр. 201-211. Springer, (2015)Structural complexity of AvgBPP.. Electron. Colloquium Comput. Complex., (2008)Tight Bounds for Tseitin Formulas., , и . SAT, том 236 из LIPIcs, стр. 6:1-6:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)