Redux: An Interactive, Dynamic Knowledge Base for Teaching NP-completeness
Abstract
References
Index Terms
- Redux: An Interactive, Dynamic Knowledge Base for Teaching NP-completeness
Recommendations
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 ...
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 ...
Comments
Information & Contributors
Information
Published In
![cover image ACM Conferences](/cms/asset/9090617a-5221-4bcf-a948-8bda328abd5f/3649217.cover.jpg)
- General Chairs:
- Mattia Monga,
- Violetta Lonati,
- Erik Barendsen,
- Program Chairs:
- Judithe Sheard,
- James Paterson
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Author Tags
Qualifiers
- Research-article
Funding Sources
- State of Idaho appropriated funding for the Center for Advanced Energy Studies (CAES)
Conference
Acceptance Rates
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 36Total Downloads
- Downloads (Last 12 months)36
- Downloads (Last 6 weeks)9
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in