An arithmetical characterization of NP
- 31 December 1982
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 21 (3) , 255-267
- https://doi.org/10.1016/0304-3975(82)90076-7
Abstract
No abstract availableThis publication has 4 references indexed in Scilit:
- The bounded arithmetic hierarchyInformation and Control, 1978
- Complete sets and the polynomial-time hierarchyTheoretical Computer Science, 1976
- The polynomial-time hierarchyTheoretical Computer Science, 1976
- On the Product of the PrimesCanadian Mathematical Bulletin, 1972