scientific article; zbMATH DE number 1114014
From MaRDI portal
Publication:4375783
zbMath0891.03024MaRDI QIDQ4375783
Publication date: 8 July 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15) Classical propositional logic (03B05) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Complexity of proofs (03F20)
Related Items (3)
Short proofs of the Kneser-Lovász coloring principle ⋮ Propositional Proofs in Frege and Extended Frege Systems (Abstract) ⋮ The provably total NP search problems of weak second order bounded arithmetic
This page was built for publication: