Why almost all satisfiable $k$-CNF formulas are easy

Finding a satisfying assignment for a $k$-CNF formula $(k \geq 3)$, assuming such exists, is a notoriously hard problem. In this work we consider the uniform distribution over satisfiable $k$-CNF formulas with a linear number of clauses (clause-variable ratio greater than some constant). We rigorous...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Discrete mathematics and theoretical computer science Ročník DMTCS Proceedings vol. AH,...; číslo Proceedings; s. 95 - 108
Hlavní autoři:	Coja-Oghlan, Amin, Krivelevich, Michael, Vilenchik, Dan
Médium:	Journal Article Konferenční příspěvek
Jazyk:	angličtina
Vydáno:	DMTCS 01.01.2007 Discrete Mathematics and Theoretical Computer Science Discrete Mathematics & Theoretical Computer Science
Edice:	DMTCS Proceedings
Témata:	[info.info-cg] computer science [cs]/computational geometry [cs.cg] [info.info-dm] computer science [cs]/discrete mathematics [cs.dm] [info.info-ds] computer science [cs]/data structures and algorithms [cs.ds] [math.math-co] mathematics [math]/combinatorics [math.co] algorithms and data structures Combinatorics computational and structural complexity Computational Geometry Computer Science Data Structures and Algorithms Discrete Mathematics Mathematics message passing algorithms sat message passing algorithms algorithms and data structures SAT computational and structural complexity
ISSN:	1365-8050, 1462-7264, 1365-8050
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!