Honest polynomial degrees and P=? NP
Open Access
- 31 December 1987
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 51 (3) , 265-280
- https://doi.org/10.1016/0304-3975(87)90036-3
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Minimal degrees for polynomial reducibilitiesJournal of the ACM, 1987
- On some natural complete operatorsTheoretical Computer Science, 1985
- A uniform approach to obtain diagonal sets in complexity classesTheoretical Computer Science, 1982
- On Degrees of Recursive UnsolvabilityAnnals of Mathematics, 1956