openmath.dev
Esc

Loading…

↑ ↓ to move↵ to open

Appearance
Appearance

Theorem · version 2

If P ≠ NP, intermediate problems exist

Statement

If P ≠ NP, then some languages in NP are neither in P nor NP-complete under polynomial-time many-one reductions.

Assumptions

  • P ≠ NP; polynomial-time many-one completeness.

Scope

Existence of NP-intermediate languages; not a classification of specific natural candidates.

Evidence

Connections

In this problem · publication v9 · Selected context

P versus NP →

Conditional implication · Proved

This statement contributes context in its stated scope; it does not settle the canonical P versus NP question.

This is one indexed assertion in its own scope. No disjoint solved fraction, strongest-known ranking or additional parent resolution is inferred.

Relationship not independently reviewed. This concerns its use in this problem.

In this problem · publication v14

P versus NP →

Conditional implication · Proved

This statement contributes context in its stated scope; it does not settle the canonical P versus NP question.

This is one indexed assertion in its own scope. No disjoint solved fraction, strongest-known ranking or additional parent resolution is inferred.

Relationship not independently reviewed. This concerns its use in this problem.

Sources

Avi Wigderson · Mathematics and Computation →

  • Theorem 4.1 [Lad75], §4.2 → · Original passage ↗
    Recorded wording

    If P ≠ NP, then some languages in NP are neither in P nor NP-complete under polynomial-time many-one reductions.

    paraphrase · Only metadata and original OpenMath paraphrases are published; proof PDFs remain at their source.

Avi Wigderson · Published · Publication date 2019

Published author exposition or original paper.

Revision & attribution

Source revision: author-draft-2019-08-06. Observed Oct 10, 2026.

AI involvement is not reported by this cited source; this is not a claim of its absence.

Avi Wigderson · Mathematics and Computation — proof text: author-draft-2019-08-06. External source text. Its mathematical claims and independent OpenMath review are assessed separately.

History

Statement versions

Statement versions and problem publication versions are separate. A new publication can update context or sources while retaining the same statement.

Assessment history · 1

Assessments retained in these publication records. Earlier statement versions retain their own source histories.

Record details
Claim ID
claim-pnp-ladner
Statement version
2
SHA-256
f2334b0604bae0775ecb40b374c8e0f91d88544a610a21be88afcd4872d4b82a

Publication records