Tail bounds for occupancy and the satisfiability threshold conjecture
Work
Year: 1995
Type: article
Source: Random Structures and Algorithms
Institutions Stanford University, Courant Institute of Mathematical Sciences, Research Academic Computer Technology Institute
Cites: 16
Cited by: 117
Related to: 10
FWCI: 8.171
Citation percentile (by year/subfield): 94.82
Topic: Advanced Algebra and Logic
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: closed