Combinatorial probability
2 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.
Satisfiability threshold for random 3-SAT: determine C 52 or improve its bounds; the repository records 3.52 (lower) and 4.490 (upper).
Chvátal–Sankoff constant for a binary alphabet: determine C 31 or improve its bounds; the repository records 0.792665992 (0.79970 ) (lower) and 0.826280 (upper).
These are selected sources for the parent class. Article coverage is a first reviewed selection, and may not cover this exact subcategory.
Institute of Mathematical Statistics
Probability theory
Journal discovery is available; article-level extraction for this class is not yet included in this batch.
View source evidence →MSC2020 © Mathematical Reviews (AMS) and zbMATH · CC BY-NC-SA 4.0 · Official PDF, page 160