2 citations · 2 across the 2 of their papers we have counts for
2 papers
cs.CC2014
Tree-like resolution complexity of two planar problems
Dmitry Itsykson, Anna Malova, Vsevolod Oparin +1
We consider two CSP problems: the first CSP encodes 2D Sperner's lemma for the standard triangulation of the right triangle on small triangles; the second CSP encodes the fac…
cs.CC2009★ 2 cited
On optimal heuristic randomized semidecision procedures, with application to proof complexity
Edward A. Hirsch, Dmitry Itsykson
The existence of a (p-)optimal propositional proof system is a major open question in (proof) complexity; many people conjecture that such systems do not exist. Krajicek and Pudlak…