A note on deterministic and nondeterministic time complexity

DOI10.1016/S0019-9958(82)90515-0zbMath0543.03026OpenAlexW2031805167MaRDI QIDQ3331208

Timothy J. Long, Shimon Even, Yacov Yacobi

Publication date: 1982

Published in: Information and Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0019-9958(82)90515-0

zbMATH Keywords

Turing machinenondeterministic computationsnondeterministic time complexitydeterministic computationsco-NP problemsNP-problems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15)

This page was built for publication: A note on deterministic and nondeterministic time complexity