scientific article; zbMATH DE number 2087215
From MaRDI portal
Publication:4737899
zbMath1073.03540MaRDI QIDQ4737899
Publication date: 11 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2295/22950100.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Complexity of proofs (03F20)
Related Items (14)
On the Proof Complexity of Paris-Harrington and Off-Diagonal Ramsey Tautologies ⋮ Expander construction in \(\mathrm{VNC}^1\) ⋮ Number of Variables for Graph Differentiation and the Resolution of Graph Isomorphism Formulas ⋮ Rank bounds for a hierarchy of Lovász and Schrijver ⋮ Resolution over linear equations and multilinear proofs ⋮ Pseudorandom generators hard for \(k\)-DNF resolution and polynomial calculus resolution ⋮ Partially definable forcing and bounded arithmetic ⋮ The treewidth of proofs ⋮ Unnamed Item ⋮ Exploiting Symmetry in SMT Problems ⋮ Propositional proof complexity ⋮ Resolution and the binary encoding of combinatorial principles ⋮ Unnamed Item ⋮ Large clique is hard on average for resolution
This page was built for publication:
