AWhat changed
Defined efficiently checkable witness-search problems and reductions between them, identified universal examples and stated an optimal-search construction in the specified computation model.
Scientific scope
Defined efficiently checkable witness-search problems and reductions between them, identified universal examples and stated an optimal-search construction in the specified computation model. Scope limitation: The result does not prove P differs from NP. Its original search formulation and resource convention must be retained. The listed graph-embedding problem concerns a subgraph; it must not be misreported as a proof that ordinary graph isomorphism is NP-complete.
Evidence
Assessment uses the catalogue-linked source evidence for the stated contribution. The result does not prove P differs from NP. Its original search formulation and resource convention must be retained. The listed graph-embedding problem concerns a subgraph; it must not be misreported as a proof that ordinary graph isomorphism is NP-complete.
Contributors
- L. A. Levin · SCIENCE: Named source contributor; exact labor shares are not measured.
Provisional WRS assessment, edition 2026-10-16.1. Independent expert calibration is pending. This grade does not certify correctness or assign ownership.
Full scientific record · Browse contribution grades · Request a correction