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...

Full description

Saved in:

Bibliographic Details
Published in:	Discrete mathematics and theoretical computer science Vol. DMTCS Proceedings vol. AH,...; no. Proceedings; pp. 95 - 108
Main Authors:	Coja-Oghlan, Amin, Krivelevich, Michael, Vilenchik, Dan
Format:	Journal Article Conference Proceeding
Language:	English
Published:	DMTCS 01.01.2007 Discrete Mathematics and Theoretical Computer Science Discrete Mathematics & Theoretical Computer Science
Series:	DMTCS Proceedings
Subjects:	[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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!