Joshua Buresh-Oppenheim

Avner Magen

Comput. Complex., 2011

A Stronger Model of Dynamic Programming Algorithms.

[BibT_eX]

[DOI]

Sashka Davis

Algorithmica, 2011

2009

Toward a Model for Backtracking and Dynamic Programming.

[BibT_eX]

[DOI]

Michael Alekhnovich

Allan Borodin

Avner Magen

Electron. Colloquium Comput. Complex., 2009

2007

The complexity of resolution refinements.

[BibT_eX]

[DOI]

J. Symb. Log., 2007

Minimum 2CNF Resolution Refutations in Polynomial Time.

[BibT_eX]

[DOI]

David G. Mitchell

Proceedings of the Theory and Applications of Satisfiability Testing, 2007

2006

Rank Bounds and Integrality Gaps for Cutting Planes Procedures.

[BibT_eX]

[DOI]

Theory Comput., 2006

Making Hard Problems Harder

[BibT_eX]

[DOI]

Rahul Santhanam

Electron. Colloquium Comput. Complex., 2006

Uniform Hardness Amplification in NP via Monotone Codes.

[BibT_eX]

[DOI]

Valentine Kabanets

Rahul Santhanam

Electron. Colloquium Comput. Complex., 2006

Minimum Witnesses for Unsatisfiable 2CNFs.

[BibT_eX]

[DOI]

David G. Mitchell

Proceedings of the Theory and Applications of Satisfiability Testing, 2006

2005

Randomness in proof complexity.

[BibT_eX]

[DOI]

PhD thesis, 2005

2004

Bounded-Depth Frege Lower Bounds for Weaker Pigeonhole Principles.

[BibT_eX]

[DOI]

SIAM J. Comput., 2004

2003

Relativized NP Search Problems and Propositional Proof Systems

[BibT_eX]

[DOI]

Tsuyoshi Morioka

Electron. Colloquium Comput. Complex., 2003

Rank Bounds and Integrality Gaps for Cutting Planes Procedures Joshua.

[BibT_eX]

[DOI]

Proceedings of the 44th Symposium on Foundations of Computer Science (FOCS 2003), 2003

2002

Homogenization and the polynomial calculus.

[BibT_eX]

[DOI]

Matthew Clegg

Comput. Complex., 2002

2001

Linear and Negative Resolution are Weaker than Resolution

[BibT_eX]

[DOI]

David G. Mitchell

Electron. Colloquium Comput. Complex., 2001

2000

Homogenization and the Polynominal Calculus.

[BibT_eX]

[DOI]

Matthew Clegg