A sharp threshold in proof complexity yields lower bounds for satisfiability search

Dimitris Achlioptas, Paul Beame, Michael Molloy

Source record

Source: Crossref

Published: Mar 1, 2004

DOI: 10.1016/j.jcss.2003.07.011

Open original source ↗

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.