Joshua Buresh-Oppenheim

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

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2011
Toward a Model for Backtracking and Dynamic Programming.
Computational Complexity, 2011

A Stronger Model of Dynamic Programming Algorithms.
Algorithmica, 2011

2009
Toward a Model for Backtracking and Dynamic Programming.
Electronic Colloquium on Computational Complexity (ECCC), 2009

2007
The complexity of resolution refinements.
J. Symb. Log., 2007

Minimum 2CNF Resolution Refutations in Polynomial Time.
Proceedings of the Theory and Applications of Satisfiability Testing, 2007

2006
Rank Bounds and Integrality Gaps for Cutting Planes Procedures.
Theory of Computing, 2006

Making Hard Problems Harder
Electronic Colloquium on Computational Complexity (ECCC), 2006

Uniform Hardness Amplification in NP via Monotone Codes.
Electronic Colloquium on Computational Complexity (ECCC), 2006

Minimum Witnesses for Unsatisfiable 2CNFs.
Proceedings of the Theory and Applications of Satisfiability Testing, 2006

Making Hard Problems Harder.
Proceedings of the 21st Annual IEEE Conference on Computational Complexity (CCC 2006), 2006

2005
Toward a Model for Backtracking and Dynamic Programming.
Proceedings of the 20th Annual IEEE Conference on Computational Complexity (CCC 2005), 2005

2004
Bounded-Depth Frege Lower Bounds for Weaker Pigeonhole Principles.
SIAM J. Comput., 2004

Relativized NP Search Problems and Propositional Proof Systems.
Proceedings of the 19th Annual IEEE Conference on Computational Complexity (CCC 2004), 2004

2003
Relativized NP Search Problems and Propositional Proof Systems
Electronic Colloquium on Computational Complexity (ECCC), 2003

The Complexity of Resolution Refinements.
Proceedings of the 18th IEEE Symposium on Logic in Computer Science (LICS 2003), 2003

Rank Bounds and Integrality Gaps for Cutting Planes Procedures Joshua.
Proceedings of the 44th Symposium on Foundations of Computer Science (FOCS 2003), 2003

2002
Bounded-depth Frege lower bounds for weaker pigeonhole principles
Electronic Colloquium on Computational Complexity (ECCC), 2002

Homogenization and the polynomial calculus.
Computational Complexity, 2002

Bounded-Depth Frege Lower Bounds for Weaker Pigeonhole Principles.
Proceedings of the 43rd Symposium on Foundations of Computer Science (FOCS 2002), 2002

2001
Linear and Negative Resolution are Weaker than Resolution
Electronic Colloquium on Computational Complexity (ECCC), 2001

2000
Homogenization and the Polynominal Calculus.
Proceedings of the Automata, Languages and Programming, 27th International Colloquium, 2000


  Loading...