The following pages link to (Q4375783):
Displaying 5 items.
- The provably total NP search problems of weak second order bounded arithmetic (Q639650) (← links)
- Short proofs of the Kneser-Lovász coloring principle (Q1641004) (← links)
- Combinatorial versus decision-theoretic components of impossibility theorems (Q1915820) (← links)
- Propositional Proofs in Frege and Extended Frege Systems (Abstract) (Q3194704) (← links)
- On the computational complexity of finding hard tautologies (Q5402611) (← links)