The Complexity Of Propositional Proofs (1995)

Cached

Download Links

by Alasdair Urquhart
Venue:Bulletin of Symbolic Logic
Citations:103 - 2 self

Active Bibliography

50 The History and Status of the P versus NP Question – Michael Sipser, Juris Hartmanis - 1992
21 The complexity of propositional proofs – Nathan Segerlind
INTRODUCTION TO THE COMBINATORICS AND COMPLEXITY OF CUT ELIMINATION – A. Carbone, S. Semmes
45 Predicative Recursion and Computational Complexity – Stephen J. Bellantoni - 1992
Postman Problems on Mixed Graphs – Francisco Javier Zaragoza Martinez - 2003
Towards NP−P via Proof Complexity and Search – Samuel R. Buss - 2009
1 The Complexity Of Derivations Of Matrix Identities – Michael Soltys-Kulinicz - 2001
7 Limitations of Restricted Branching in Clause Learning – Matti Järvisalo, Tommi Junttila
13 The P versus NP problem – Stephen Cook - 2000
2 Convergence Properties of Optimization Algorithms for the Satisfiability (SAT) Problem – Jun Gu, Qian-ping Gu, Ding Zhu Du - 1996
1 Adding a New Conflict Based Branching Heuristic in two Evolved DPLL SAT Solvers – Renato Bruni, Andrea Santori
Boolean Satisfiability -- From Theoretical . . . – Harad Malik, et al. - 2009
7 SEARCHING FOR TRUTH: TECHNIQUES FOR SATISFIABILITY OF BOOLEAN FORMULAS – Lintao Zhang, Sharad Malik, Aarti Gupta - 2003
2 Application of CUDA in the Boolean Domain for the Unate Covering Problem – Eric Paul, Bernd Steinbach, Marek Perkowski - 2010
20 Global Optimization for Satisfiability (SAT) Problem – Jun Gu - 1994
161 Improvements To Propositional Satisfiability Search Algorithms – Jon William Freeman - 1995
1 NP and Mathematics - a computational complexity perspective – Avi Wigderson, Steve Smale
57 Contingent Planning Under Uncertainty via Stochastic Satisfiability – Stephen M. Majercik, Michael L. Littman - 1999
The Satisfiability Problem- From The Theory of NP-completeness to State-Of-The-Art SAT Solvers – Rave Harpaz