scientific article
From MaRDI portal
Publication:3765752
zbMath0629.03013MaRDI QIDQ3765752
Publication date: 1987
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
polynomial complexityderivability of formulasimplicative normal formsquasipolynomial algorithmssatisfiability of propositional formulas
Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15)
Related Items (1)
This page was built for publication:
