P, NP, and NP-Completeness: the basics of computational complexity by Oded Goldreich
Abstract
Index Terms
- P, NP, and NP-Completeness: the basics of computational complexity by Oded Goldreich
Recommendations
Partial Bi-immunity, Scaled Dimension, and NP-Completeness
The Turing and many-one completeness notions for NP have been previously separated under measure, genericity, and bi-immunity hypotheses on NP. The proofs of all these results rely on the existence of a language in NP with almost everywhere hardness.
In ...
Nonuniform Reductions and NP-Completeness
AbstractNonuniformity is a central concept in computational complexity with powerful connections to circuit complexity and randomness. Nonuniform reductions have been used to study the isomorphism conjecture for NP and completeness for larger complexity ...
Comments
Information & Contributors
Information
Published In
![cover image ACM SIGSOFT Software Engineering Notes](/cms/asset/a76e4604-1d37-4205-8742-7769eeb5e732/1921532.cover.jpg)
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Qualifiers
- Review-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 300Total Downloads
- Downloads (Last 12 months)8
- Downloads (Last 6 weeks)0
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in