Construct · 1 fields · 1 citations

satisfiability phase transition: a standalone construct

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

● anchor · a standalone construct Nearest construct by meaning·not indexed
satisfiabilityphase transition1 CONSTRUCTSatisfiability phaseKIRKPATRICK · COMPUTATIONAL

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 abrupt change from mostly satisfiable to mostly unsatisfiable random formulas at a critical clause-to-variable ratio, where instances are hardest.

In computational complexity, satisfiability phase transition refers to the abrupt change from mostly satisfiable to mostly unsatisfiable random formulas at a critical clause-to-variable ratio, where instances are hardest. This meaning comes from Kirkpatrick (1994) in Science.[1]

Unit
Recovery means
Measured by

Next

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

See how satisfiability phase transition sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in ColliderExport BibTeXReport this entry

Nearby constructs

complexity4 fields · 7 citationsjingle · one word, four constructsphase5 fields · 6 citationsjingle · one word, five constructssatisfiability1 fields · 1 citationsanchor · a standalone construct

References

  1. Kirkpatrick, S., & Selman, B. (1994). Critical Behavior in the Satisfiability of Random Boolean Expressions. Science, 264(5163), 1297-1301. https://doi.org/10.1126/science.264.5163.1297

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