The index

Explore the frontier

2 entries matching the current filters. Sorted by recently added.

OP-12064Computational complexityOpen

Satisfiability threshold for random 3-SAT ( $C_{52}$ )

Satisfiability threshold for random 3-SAT: determine C 52 or improve its bounds; the repository records 3.52 (lower) and 4.490 (upper).

Optimization Constants in Mathematics — Davis, Ivanisvili & Tao· Licensed source statement· 2026

OP-12041ProbabilityOpen

Chvátal–Sankoff constant for a binary alphabet ( $C_{31}$ )

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).

Optimization Constants in Mathematics — Davis, Ivanisvili & Tao· Licensed source statement· 2026

Satisfiability threshold for random 3-SAT (C52C_{52}C52​)

Chvátal–Sankoff constant for a binary alphabet (C31C_{31}C31​)

Satisfiability threshold for random 3-SAT ( $C_{52}$ )

Chvátal–Sankoff constant for a binary alphabet ( $C_{31}$ )