scientific article
From MaRDI portal
Publication:3444802
zbMath1122.03057MaRDI QIDQ3444802
A. A. Kozhevnikov, Dmitry Itsykson
Publication date: 4 June 2007
Full work available at URL: http://www.pdmi.ras.ru/znsl/2006/v340.html
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity of proofs (03F20)
Related Items (3)
Towards NP-P via proof complexity and search ⋮ Near-optimal lower bounds on regular resolution refutations of Tseitin formulas for all constant-degree graphs ⋮ Satisfiable Tseitin Formulas Are Hard for Nondeterministic Read-Once Branching Programs.
This page was built for publication:
