On the phase transitions of \((k, q)\)-SAT (Q517195): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: The threshold for random 𝑘-SAT is 2^{𝑘}log2-𝑂(𝑘) / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the phase transitions of random \(k\)-constraint satisfaction problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A general model and thresholds for random constraint satisfaction problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A sharp threshold for a random constraint satisfaction problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Random \(k\)-SAT: A tight threshold for moderately growing \(k\) / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4954175 / rank | |||
Normal rank | |||
Latest revision as of 14:26, 13 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the phase transitions of \((k, q)\)-SAT |
scientific article |
Statements
On the phase transitions of \((k, q)\)-SAT (English)
0 references
23 March 2017
0 references
The main result of the paper proves an asymptotic zero-one limit of the probability that an instant \((C,Q)\) is satisfiable, i.e., there exists an assignment that does not set any of the \(k\)-tuples of randomly generated Boolean variables in \(C\) to a given bad tuple set of assignments in \(Q\).
0 references
constraint satisfaction
0 references
phase transition
0 references
second moment method
0 references
