 | 2009 |
|---|
| 9 |       | Dmitry Itsykson:
Structural Complexity of AvgBPP.
CSR 2009: 155-166 |
| 8 | | Edward A. Hirsch,
Dmitry Itsykson:
On optimal heuristic randomized semidecision procedures, with application to proof complexity
CoRR abs/0908.2707: (2009) |
| 2008 |
|---|
| 7 | | Edward A. Hirsch,
Dmitry Itsykson:
An Infinitely-Often One-Way Function Based on an Average-Case Assumption.
WoLLIC 2008: 208-217 |
| 6 | | Dmitry Itsykson:
Structural complexity of AvgBPP.
Electronic Colloquium on Computational Complexity (ECCC) 15(073): (2008) |
| 2007 |
|---|
| 5 | | Edward A. Hirsch,
Dmitry Itsykson:
An infinitely-often one-way function based on an average-case assumption.
Electronic Colloquium on Computational Complexity (ECCC) 14(117): (2007) |
| 2006 |
|---|
| 4 | | Arist Kojevnikov,
Dmitry Itsykson:
Lower Bounds of Static Lovász-Schrijver Calculus Proofs for Tseitin Tautologies.
ICALP (1) 2006: 323-334 |
| 2005 |
|---|
| 3 | | Michael Alekhnovich,
Edward A. Hirsch,
Dmitry Itsykson:
Exponential Lower Bounds for the Running Time of DPLL Algorithms on Satisfiable Formulas.
J. Autom. Reasoning 35(1-3): 51-72 (2005) |
| 2004 |
|---|
| 2 | | Michael Alekhnovich,
Edward A. Hirsch,
Dmitry Itsykson:
Exponential Lower Bounds for the Running Time of DPLL Algorithms on Satisfiable Formulas.
ICALP 2004: 84-96 |
| 1 | | Michael Alekhnovich,
Edward A. Hirsch,
Dmitry Itsykson:
Exponential lower bounds for the running time of DPLL algorithms on satisfiable formulas
Electronic Colloquium on Computational Complexity (ECCC)(041): (2004) |
