|
Search the dblp DataBase
Joshua Buresh-Oppenheim:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Michael Alekhnovich, Allan Borodin, Joshua Buresh-Oppenheim, Russell Impagliazzo, Avner Magen, Toniann Pitassi
Toward a Model for Backtracking and Dynamic Programming. [Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2005, pp:308-322 [Conf]
- Joshua Buresh-Oppenheim, Rahul Santhanam
Making Hard Problems Harder. [Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2006, pp:73-87 [Conf]
- Joshua Buresh-Oppenheim, David G. Mitchell
Minimum Witnesses for Unsatisfiable 2CNFs. [Citation Graph (0, 0)][DBLP] SAT, 2006, pp:42-47 [Conf]
- Joshua Buresh-Oppenheim, Rahul Santhanam
Making Hard Problems Harder [Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2006, v:, n:003, pp:- [Journal]
- Joshua Buresh-Oppenheim, Paul Beame, Toniann Pitassi, Ran Raz, Ashish Sabharwal
Bounded-Depth Frege Lower Bounds for Weaker Pigeonhole Principles. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2004, v:34, n:2, pp:261-276 [Journal]
- Joshua Buresh-Oppenheim, David G. Mitchell
Minimum 2CNF Resolution Refutations in Polynomial Time. [Citation Graph (0, 0)][DBLP] SAT, 2007, pp:300-313 [Conf]
Uniform Hardness Amplification in NP via Monotone Codes. [Citation Graph (, )][DBLP]
Search in 0.003secs, Finished in 0.003secs
|