On the critical exponents of random k‐SAT
Work
Year: 2002
Type: article
Abstract: There has been much recent interest in the satisfiability of random Boolean formulas. A random k-SAT formula is the conjunction of m random clauses, each of which is the disjunction of k literals (a v... more
Source: Random Structures and Algorithms
Author David B. Wilson
Institution Microsoft (United States)
Cites: 33
Cited by: 16
Related to: 10
FWCI: 2.026
Citation percentile (by year/subfield): 91.99
Subfield: Computer Networks and Communications
Field: Computer Science
Domain: Physical Sciences
Open Access status: green