Joshua Buresh-Oppenheim

Publication Activity (10 Years)

Years Active: 2004-2011
Publications (10 Years): 0

Publications

Michael Alekhnovich, Allan Borodin, Joshua Buresh-Oppenheim, Russell Impagliazzo, Avner Magen, Toniann Pitassi
Toward a Model for Backtracking and Dynamic Programming. Comput. Complex. 20 (4) (2011)
Joshua Buresh-Oppenheim, Sashka Davis, Russell Impagliazzo
A Stronger Model of Dynamic Programming Algorithms. Algorithmica 60 (4) (2011)
Michael Alekhnovich, Allan Borodin, Joshua Buresh-Oppenheim, Russell Impagliazzo, Avner Magen
Toward a Model for Backtracking and Dynamic Programming. Electron. Colloquium Comput. Complex. 16 (2009)
Joshua Buresh-Oppenheim, Toniann Pitassi
The complexity of resolution refinements. J. Symb. Log. 72 (4) (2007)
Joshua Buresh-Oppenheim, David G. Mitchell
Minimum 2CNF Resolution Refutations in Polynomial Time. SAT (2007)
Joshua Buresh-Oppenheim, Rahul Santhanam
Making Hard Problems Harder Electron. Colloquium Comput. Complex. (003) (2006)
Joshua Buresh-Oppenheim, David G. Mitchell
Minimum Witnesses for Unsatisfiable 2CNFs. SAT (2006)
Joshua Buresh-Oppenheim, Rahul Santhanam
Making Hard Problems Harder. Computational Complexity Conference (2006)
Joshua Buresh-Oppenheim, Nicola Galesi, Shlomo Hoory, Avner Magen, Toniann Pitassi
Rank Bounds and Integrality Gaps for Cutting Planes Procedures. Theory Comput. 2 (4) (2006)
Joshua Buresh-Oppenheim, Valentine Kabanets, Rahul Santhanam
Uniform Hardness Amplification in NP via Monotone Codes. Electron. Colloquium Comput. Complex. 13 (154) (2006)
Michael Alekhnovich, Allan Borodin, Joshua Buresh-Oppenheim, Russell Impagliazzo, Avner Magen, Toniann Pitassi
Toward a Model for Backtracking and Dynamic Programming. Computational Complexity Conference (2005)
Joshua Buresh-Oppenheim, Paul Beame, Toniann Pitassi, Ran Raz, Ashish Sabharwal
Bounded-Depth Frege Lower Bounds for Weaker Pigeonhole Principles. SIAM J. Comput. 34 (2) (2004)