Joshua Buresh-Oppenheim

According to our database, Joshua Buresh-Oppenheim authored at least 16 papers between 2000 and 2011.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2011

A Stronger Model of Dynamic Programming Algorithms.

Joshua Buresh-Oppenheim, Sashka Davis, Russell Impagliazzo

Algorithmica, 2011

2009

Toward a Model for Backtracking and Dynamic Programming.

Michael Alekhnovich, Allan Borodin, Joshua Buresh-Oppenheim, Russell Impagliazzo, Avner Magen

Electron. Colloquium Comput. Complex., 2009

2007

Minimum 2CNF Resolution Refutations in Polynomial Time.

Joshua Buresh-Oppenheim, David G. Mitchell

Proceedings of the Theory and Applications of Satisfiability Testing, 2007

2006

Rank Bounds and Integrality Gaps for Cutting Planes Procedures.

Joshua Buresh-Oppenheim, Nicola Galesi, Shlomo Hoory, Avner Magen, Toniann Pitassi

Theory Comput., 2006

Uniform Hardness Amplification in NP via Monotone Codes.

Joshua Buresh-Oppenheim, Valentine Kabanets, Rahul Santhanam

Electron. Colloquium Comput. Complex., 2006

Minimum Witnesses for Unsatisfiable 2CNFs.

Joshua Buresh-Oppenheim, David G. Mitchell

Proceedings of the Theory and Applications of Satisfiability Testing, 2006

Making Hard Problems Harder.

Joshua Buresh-Oppenheim, Rahul Santhanam

Proceedings of the 21st Annual IEEE Conference on Computational Complexity (CCC 2006), 2006

2005

Randomness in proof complexity.

Joshua Buresh-Oppenheim

PhD thesis, 2005

Toward a Model for Backtracking and Dynamic Programming.

Michael Alekhnovich, Allan Borodin, Joshua Buresh-Oppenheim, Russell Impagliazzo, Avner Magen, Toniann Pitassi

Proceedings of the 20th Annual IEEE Conference on Computational Complexity (CCC 2005), 2005

2004

Relativized NP Search Problems and Propositional Proof Systems.

Josh Buresh-Oppenheim, Tsuyoshi Morioka

Proceedings of the 19th Annual IEEE Conference on Computational Complexity (CCC 2004), 2004

2003

The Complexity of Resolution Refinements.

Josh Buresh-Oppenheim, Toniann Pitassi

Proceedings of the 18th IEEE Symposium on Logic in Computer Science (LICS 2003), 2003

Rank Bounds and Integrality Gaps for Cutting Planes Procedures Joshua.

Josh Buresh-Oppenheim, Nicola Galesi, Shlomo Hoory, Avner Magen, Toniann Pitassi

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

2002

Homogenization and the polynomial calculus.

Josh Buresh-Oppenheim, Matthew Clegg, Russell Impagliazzo, Toniann Pitassi

Comput. Complex., 2002

Bounded-Depth Frege Lower Bounds for Weaker Pigeonhole Principles.

Josh Buresh-Oppenheim, Paul Beame, Toniann Pitassi, Ran Raz, Ashish Sabharwal

Proceedings of the 43rd Symposium on Foundations of Computer Science, 2002

2001

Linear and Negative Resolution are Weaker than Resolution

Josh Buresh-Oppenheim, David G. Mitchell, Toniann Pitassi

Electron. Colloquium Comput. Complex., 2001

2000

Homogenization and the Polynominal Calculus.

Josh Buresh-Oppenheim, Matthew Clegg, Russell Impagliazzo, Toniann Pitassi

Proceedings of the Automata, Languages and Programming, 27th International Colloquium, 2000