scientific article; zbMATH DE number 1390075
From MaRDI portal
Publication:4934341
zbMath0940.03051MaRDI QIDQ4934341
Publication date: 13 July 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Complexity of computation (including implicit computational complexity) (03D15) Classical propositional logic (03B05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (9)
On the Boolean connectivity problem for Horn relations ⋮ On the Structure of Solution-Graphs for Boolean Formulas ⋮ Unique Perfect Phylogeny Is NP-Hard ⋮ Recognizing frozen variables in constraint satisfaction problems ⋮ Isomorphic implication ⋮ Unnamed Item ⋮ As Close as It Gets ⋮ Minimal distance of propositional models ⋮ Boolean Constraint Satisfaction Problems: When Does Post’s Lattice Help?
This page was built for publication:
