Exact Perfect Matching in Complete Graphs. | 0 | 0.34 | 2017 |
Game Values and Computational Complexity: An Analysis via Black-White Combinatorial Games. | 1 | 0.37 | 2015 |
Planarizing gadgets for perfect matching do not exist | 0 | 0.34 | 2011 |
A kolmogorov complexity proof of the lovász local lemma for satisfiability | 2 | 0.40 | 2011 |
Nondeterministic functions and the existence of optimal proof systems | 9 | 0.56 | 2009 |
On the Complexity of Resolution with Bounded Conjunctions | 22 | 0.92 | 2004 |
Optimal proof systems imply complete sets for promise classes | 25 | 0.94 | 2003 |
On the Structure of the Simulation Order of Proof Systems | 1 | 0.38 | 2002 |
Is the Standard Proof System for SAT P-Optimal? | 10 | 0.63 | 2000 |