Satisfiability threshold for random 3-SAT ()
Satisfiability threshold for random 3-SAT: determine C 52 or improve its bounds; the repository records 3.52 (lower) and 4.490 (upper).
Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) [See also 68W20, 68W40]
1 mapped entries · Browse and filter all →
Counts include all statuses and descendants. Classifications are editorial or inferred from community fields, not an AMS assessment of the problem.
These are selected sources for the parent class. Article coverage is a first reviewed selection, and may not cover this exact subcategory.
Springer Nature
Discrete geometry and geometric computation
SIAM
Theory of computation
SIAM
Applied and computational mathematics reviews
2007 · 2 questions extracted
2020 · 0 questions extracted
MSC2020 © Mathematical Reviews (AMS) and zbMATH · CC BY-NC-SA 4.0 · Official PDF, page 177