scientific article; zbMATH DE number 1414291
From MaRDI portal
Publication:4942628
zbMath0941.68581MaRDI QIDQ4942628
Publication date: 16 March 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Complexity of computation (including implicit computational complexity) (03D15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (6)
On computing the smallest four-coloring of planar graphs and non-self-reducible sets in P ⋮ The consequences of eliminating NP solutions ⋮ Optimal satisfiability for propositional calculi and constraint satisfaction problems. ⋮ On the autoreducibility of functions ⋮ The complexity of power-index comparison ⋮ Relating polynomial time to constant depth
This page was built for publication:
