Untitled
Work
Year: 2007
Type: article
Abstract: A simple nonconstructive argument shows that most 3CNF formulas with cn clauses (where c is a sufficiently large constant) are not satisfiable.It is an open question whether there is an efficient refu... more
Source: Theory of Computing
Authors Uriel Feige, E. O. Ofek
Cites: 13
Cited by: 29
Related to: 10
FWCI: 1.515
Citation percentile (by year/subfield): 91.72
Topic: Advanced Algebra and Logic
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid