Publication:5718678
From MaRDI portal
zbMath1089.03049MaRDI QIDQ5718678
Publication date: 16 January 2006
proof complexity; weak pigeonhole principle; exponentially large finite relational structures; weak proof systems
03F20: Complexity of proofs
Related Items
Substitutions into propositional tautologies, On meta complexity of propositional formulas and propositional proofs, Typical forcings, NP search problems and an extension of a theorem of Riis