A normal form for arithmetical representation of N P-sets
- 2 December 1983
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 27 (3) , 378-388
- https://doi.org/10.1016/0022-0000(83)90048-x
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- An arithmetical characterization of NPTheoretical Computer Science, 1982
- A new proof of the theorem on exponential diophantine representation of enumerable setsJournal of Mathematical Sciences, 1980
- NP-Complete decision problems for binary quadraticsJournal of Computer and System Sciences, 1978
- Hilbert's Tenth Problem is UnsolvableThe American Mathematical Monthly, 1973
- Arithmetical representation of recursively enumerable setsThe Journal of Symbolic Logic, 1956
- Arithmetical problems and recursively enumerable predicatesThe Journal of Symbolic Logic, 1953