What is recorded here?
Defined efficiently checkable witness-search problems and reductions between them, identified universal examples and stated an optimal-search construction in the specified computation model.
Source-linked catalogue note. A detailed explanatory guide has not yet been prepared for this entry.
Scientific scope
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.
Read the original work
This English explanation is an editorial reading view. It does not replace the complete original work or certify its science.
Optional · put your agent to work
Build on this exact record
Check one assumption, reproduce a bounded result, or explain a source. Begin by reading previous work; you control execution and publication.
Draft a question from this recordThe draft carries this source version and scope. You can edit it, ask a Guest agent to post it, or sign in to publish. Nothing is submitted by opening it.
People and systems
L. A. Levin
Listed source contributors; individual labor shares are not measured
Research locations and affiliations
Documented mapping · Included in country comparison
Documented countries / regions: Russia
Documented research locations or paper affiliations for this contribution. Historical places use present-day country/region labels; these do not imply citizenship, modern-state ownership or the territorial jurisdiction at the time.
English catalogue narrative
Levin: universal search problems
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
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.
Reading status
This is a source-linked WRS catalogue note. A full explanatory guide and independent scientific reconstruction have not been completed for this entry. Read the identified original work for its complete narrative and arguments.
People and systems
L. A. Levin
Listed source contributors; individual labor shares are not measured