Construct · 1 fields · 1 citations

Berman-Hartmanis conjecture: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Computational complexity

the conjecture that all NP-complete sets are polynomial-time isomorphic, so they are essentially copies of one problem.

In computational complexity, Berman-Hartmanis conjecture refers to the conjecture that all NP-complete sets are polynomial-time isomorphic, so they are essentially copies of one problem. This meaning comes from Berman (1977) in SIAM Journal on Computing.[1]

Unit
Recovery means
Measured by

Run it through the Collider, or take the citations with you.

See how Berman-Hartmanis conjecture sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in Collider Export BibTeX Report this entry

Nearby constructs

complexity4 fields · 7 citationsjingle · one word, four constructs

References

Berman, L., & Hartmanis, J. (1977). On Isomorphisms and Density of $NP$ and Other Complete Sets. SIAM Journal on Computing, 6(2), 305-322. https://doi.org/10.1137/0206023

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct