4.5 Article

The Local Lemma Is Asymptotically Tight for SAT

相关参考文献

注意:仅列出部分参考文献,下载原文获取全部文献信息。
Article Mathematics

Disproof of the neighborhood conjecture with implications to SAT

Heidi Gebauer

COMBINATORICA (2012)

Article Computer Science, Hardware & Architecture

A Constructive Proof of the General Lovasz Local Lemma

Robin A. Moser et al.

JOURNAL OF THE ACM (2010)

Article Computer Science, Theory & Methods

Computing unsatisfiable k-SAT instances with few occurrences per variable

S Hoory et al.

THEORETICAL COMPUTER SCIENCE (2005)

Article Mathematics, Applied

Homomorphisms of conjunctive normal forms

S Szeider

DISCRETE APPLIED MATHEMATICS (2003)

Review Computer Science, Theory & Methods

Searching games with errors - fifty years of coping with liars

A Pelc

THEORETICAL COMPUTER SCIENCE (2002)

Article Computer Science, Theory & Methods

DNF tautologies with a limited number of occurrences of every variable

P Savicky et al.

THEORETICAL COMPUTER SCIENCE (2000)