
Search the dblp DataBase
Dmitry Itsykson:
[Publications]
[Author Rank by year]
[Coauthors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
 Michael Alekhnovich, Edward A. Hirsch, Dmitry Itsykson
Exponential Lower Bounds for the Running Time of DPLL Algorithms on Satisfiable Formulas. [Citation Graph (0, 0)][DBLP] ICALP, 2004, pp:8496 [Conf]
 Arist Kojevnikov, Dmitry Itsykson
Lower Bounds of Static LovászSchrijver Calculus Proofs for Tseitin Tautologies. [Citation Graph (0, 0)][DBLP] ICALP (1), 2006, pp:323334 [Conf]
 Michael Alekhnovich, Edward A. Hirsch, Dmitry Itsykson
Exponential lower bounds for the running time of DPLL algorithms on satisfiable formulas [Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:041, pp: [Journal]
 Michael Alekhnovich, Edward A. Hirsch, Dmitry Itsykson
Exponential Lower Bounds for the Running Time of DPLL Algorithms on Satisfiable Formulas. [Citation Graph (0, 0)][DBLP] J. Autom. Reasoning, 2005, v:35, n:13, pp:5172 [Journal]
Structural Complexity of AvgBPP. [Citation Graph (, )][DBLP]
Lower Bound on AverageCase Complexity of Inversion of Goldreich's Function by Drunken Backtracking Algorithms. [Citation Graph (, )][DBLP]
On Optimal Heuristic Randomized Semidecision Procedures, with Application to Proof Complexity. [Citation Graph (, )][DBLP]
An InfinitelyOften OneWay Function Based on an AverageCase Assumption. [Citation Graph (, )][DBLP]
On optimal heuristic randomized semidecision procedures, with application to proof complexity [Citation Graph (, )][DBLP]
Structural complexity of AvgBPP. [Citation Graph (, )][DBLP]
An infinitelyoften oneway function based on an averagecase assumption. [Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.003secs
