scientific article
From MaRDI portal
Publication:3882451
zbMath0441.03021MaRDI QIDQ3882451
Publication date: 1977
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
complexity classes P and NPadmissible measureclosure of NP under complementationcomplexity of derivations in complete formal systemsquantifier-free Horn formulae
Complexity of computation (including implicit computational complexity) (03D15) Complexity of proofs (03F20)
Related Items (2)
Short proofs of the Kneser-Lovász coloring principle ⋮ Some remarks on lengths of propositional proofs
This page was built for publication:
