scientific article
From MaRDI portal
Publication:3698788
zbMath0577.03020MaRDI QIDQ3698788
Publication date: 1985
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
NPPpolynomial-time degreespolynomial time reducibilitiesdecomposition completepolynomial time computable setsubproblem complete
Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15) Recursive functions and relations, subrecursive hierarchies (03D20) Other degrees and reducibilities in computability and recursion theory (03D30)
Related Items (2)
A note on complete problems for complexity classes ⋮ Honest polynomial time reducibilities and the \(P=?NP\) problem
This page was built for publication:
