Disproof of the Neighborhood Conjecture with Implications to SAT

DOI10.1007/978-3-642-04128-0_68zbMath1256.68083OpenAlexW2571414590MaRDI QIDQ3639289

Heidi Gebauer

Publication date: 29 October 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/20.500.11850/61671

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Hypergraphs (05C65) Positional games (pursuit and evasion, etc.) (91A24)

Related Items (2)

A Kolmogorov complexity proof of the Lovász local lemma for satisfiability ⋮ The Lovász Local Lemma and Satisfiability

This page was built for publication: Disproof of the Neighborhood Conjecture with Implications to SAT