Joshua Buresh-Oppenheim

Affiliations:
  • University of California, San Diego, USA


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

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2011
Toward a Model for Backtracking and Dynamic Programming.
Comput. Complex., 2011

A Stronger Model of Dynamic Programming Algorithms.
Algorithmica, 2011

2009
Toward a Model for Backtracking and Dynamic Programming.
Electron. Colloquium Comput. Complex., 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 Comput., 2006

Making Hard Problems Harder
Electron. Colloquium Comput. Complex., 2006

Uniform Hardness Amplification in NP via Monotone Codes.
Electron. Colloquium Comput. Complex., 2006

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

2005
Randomness in proof complexity.
PhD thesis, 2005

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

2003
Relativized NP Search Problems and Propositional Proof Systems
Electron. Colloquium Comput. Complex., 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
Homogenization and the polynomial calculus.
Comput. Complex., 2002

2001
Linear and Negative Resolution are Weaker than Resolution
Electron. Colloquium Comput. Complex., 2001

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


  Loading...