The following pages link to (Q4790380):
Displayed 19 items.
- Towards NP-P via proof complexity and search (Q408544) (← links)
- On the empirical time complexity of finding optimal solutions vs proving optimality for Euclidean TSP instances (Q497453) (← links)
- An improved time-space lower bound for tautologies (Q652633) (← links)
- Spines of random constraint satisfaction problems: definition and connection with computational complexity (Q812393) (← links)
- On finding short resolution refutations and small unsatisfiable subsets (Q820148) (← links)
- Proof complexity of modal resolution (Q832717) (← links)
- Cliques enumeration and tree-like resolution proofs (Q1708271) (← links)
- Understanding cutting planes for QBFs (Q1784953) (← links)
- Pseudorandom generators hard for \(k\)-DNF resolution and polynomial calculus resolution (Q2255289) (← links)
- Partially definable forcing and bounded arithmetic (Q2257103) (← links)
- Characterising tree-like Frege proofs for QBF (Q2272983) (← links)
- Quasipolynomial size proofs of the propositional pigeonhole principle (Q2344736) (← links)
- Propositional Proofs in Frege and Extended Frege Systems (Abstract) (Q3194704) (← links)
- On the correspondence between arithmetic theories and propositional proof systems – a survey (Q3619867) (← links)
- (Q4625692) (← links)
- An Introduction to Lower Bounds on Resolution Proof Systems (Q5135261) (← links)
- Hardness Characterisations and Size-width Lower Bounds for QBF Resolution (Q5886517) (← links)
- Random \( \Theta (\log n) \) -CNFs are Hard for Cutting Planes (Q5889793) (← links)
- Understanding the Relative Strength of QBF CDCL Solvers and QBF Resolution (Q6135750) (← links)