scientific article
From MaRDI portal
Publication:3033321
zbMath0691.68045MaRDI QIDQ3033321
Publication date: 1986
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
determinismTuring machinesNP-complete problemsnondeterminismcomplexity theoryrecursion theorytwo-person gamepolynomial time approximation schemesoptimal lower boundspriority argumentsP\(\neq NP\)
Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15) Applications of computability and recursion theory (03D80)
Related Items (2)
On computational complexity and honest polynomial degrees ⋮ The complexity of matrix transposition on one-tape off-line Turing machines
This page was built for publication: