On the critical exponents of random k‐SAT

DOI10.1002/rsa.10050zbMath1012.68088arXivmath/0005136OpenAlexW3100778348MaRDI QIDQ4803316

David Bruce Wilson

Publication date: 2 April 2003

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0005136

zbMATH Keywords

critical exponentsatisfiabilitythresholdrandom Boolean formulas

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Randomized algorithms (68W20)

Related Items (3)

Finite size scaling for the core of large random hypergraphs ⋮ Structure of large random hypergraphs ⋮ Exact location of the phase transition for random (1,2)-QSAT

Cites Work

• Almost all graphs with average degree 4 are 3-colorable
• Unnamed Item
• Unnamed Item

This page was built for publication: On the critical exponents of random k‐SAT