Searching for "Separation of NP-Completeness Notions." – sorted by Relevance.
-
Separation of NP-completeness notions
- SEPARATION OF NP-COMPLETENESS NOTIONS A. PAVAN AND ALAN L SELMAN † Abstract. We use hypotheses
- Cited by 19 (9 self) – Add To MetaCart
-
Average-Case Complexity Theory and Polynomial-Time Reductions
- we separate ordinary NP-completeness notions. The average-case complexity of a problem is, in many
- Cited by 2 (0 self) – Add To MetaCart
-
Partial Bi-immunity, Scaled Dimension, and NP-Completeness
- previous work. We also use this theorem to separate the NP-completeness notions under a scaleddimension
- Add To MetaCart
-
Partial Bi-immunity and NP-Completeness
- language in NP with almost everywhere hardness. In this paper we separate the same NP-completeness notions
- Add To MetaCart
-
Partial Bi-immunity, Scaled Dimension, and NP-Completeness
- separate the same NP-completeness notions under a partial bi-immunity hypothesis that is weaker and only
- Add To MetaCart
-
Hardness hypotheses, derandomization, and circuit complexity
- that it implies a separation of NP-completeness notions. The easy witness method readily applies to show
- Cited by 17 (3 self) – Add To MetaCart

