Timeline for The number of $3$-CNF formulas in $n$-variables and the fraction of satisfiable ones
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 9, 2023 at 8:04 | comment | added | Emil Jeřábek | I should have written $\beta n$ rather than $\le\beta n$ (but this proably does not make a difference). | |
| Feb 9, 2023 at 7:39 | comment | added | Emil Jeřábek | @user1642683 It means that for any fixed $\beta<\alpha$, the limit of the fraction of satisfiable formulas among random $3$-CNF with $n$ variables and $\le\beta n$ clauses as $n\to\infty$ is $1$. | |
| Aug 22, 2022 at 15:55 | comment | added | user1642683 | Also, could you explain to me what means "formula is almost surely satisfiable" in this context ? | |
| Aug 21, 2022 at 11:33 | comment | added | user1642683 | Must the clauses in $\alpha n$ do be distinct, in what sense, in the one from my OQ ? | |
| Aug 21, 2022 at 11:32 | vote | accept | user1642683 | ||
| Aug 20, 2022 at 18:57 | history | edited | Tony Huynh | CC BY-SA 4.0 |
edited body
|
| Aug 20, 2022 at 18:24 | history | edited | LSpice | CC BY-SA 4.0 |
Title of "this paper"
|
| Aug 20, 2022 at 18:09 | history | answered | Tony Huynh | CC BY-SA 4.0 |