Random 2-SAT does not depend on a giant

SIAM Journal on Discrete Mathematics

Volumn 21, Issue 2, 2007, Pages 408-422

  Kravitz, David ^a  

^a NATIONAL SECURITY AGENCY   (United States)

Author keywords

Algorithms; Boolean; Clauses; Literals; Offline; Online; Random processes; SAT; Satisfiability

Indexed keywords

APPLIED MATHEMATICS; N VERTEX GRAPH; NEW MODEL; SATISFIABILITY (QSAT); STANDARD MODEL (SM); TRANSITION (JEL CLASSIFICATIONS:E52 ,E41 ,E31);

MATHEMATICAL MODELS; RANDOM PROCESSES; STANDARDS;

BOOLEAN FUNCTIONS;

EID: 38049160967     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/060662216     Document Type: Article

References (16)

1. D. ACHLIOPTAS, A. NAOR, AND Y. PERES, On the maximum satisfiability of random formulas, in Proceedings of the 44th Symposium on Foundations of Computer Science (FOCS 2003), IEEE, New York, 2003, pp. 362-370.
2. k(In 2 + o(1)), J. Amer. Math. Soc., 17 (2004), pp. 947-973.
3. N. ALON, J. H. SPENCER, AND P. ERDÖS, The Probabilistic Method, John Wiley and Sons, New York, 1992.
4. B. BOLLOBÁS, C. BORGS, J. CHAYES, J. H. KIM, AND D. B. WILSON, The scaling window of the 2-SAT transition, Random Structures Algorithms, 18 (2001), pp. 201-256.
5. B. BOLLOBÁS, Modern Graph Theory, Springer, New York, 1998.
6. D. COPPERSMITH, D. GAMARNIK, M. HAJIAGHAYI, AND G. SORKIN, Random MAX SAT, random MAX CUT, and their phase transitions, Random Structures Algorithms, 24 (2004), pp. 502-545.
7. C. COOPER, A. FRIEZE, AND G. SORKIN, Random 2-SAT with Prescribed Literal Degrees, in Proceedings of the 13th Annual Symposium on ACM-SIAM Discrete Algorithms, ACM, New York, 2002, pp. 316-320.
8. V. CHVÁTAL AND B. REED, Mick gets some (the odds are on his side), in Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, Pittsburgh, PA, 1992, IEEE, Los Alamitos, CA, 1992, pp. 620-627.
9. P. ERDÓ́S AND A. RÉNYI, On the Evolution of Random Graphs, Pub. Math. Inst. Hungarian Acad. Sci., 5, pp. 17-61.
10. W. F. DE LA VEGA, Random 2-SAT: Results and problems, Theoret. Comput. Sci., 265 (2001), pp. 131-146.
11. A. GOERDT, A threshold for unsatisfiability, J. Comput. System Sci., 53 (1996), pp. 469-486.
12. S. JANSON, T. LUCZAK, AND A. RUCIŃSKI, Random Graphs, Wiley-Intersc. Ser. Discrete Math. Optim., Wiley-Interscience, New York, 2000.
13. C. MCDIARMID, Concentration, in Probabilistic Methods for Algorithmic Discrete Mathematics, Springer, New York, 1998, pp. 195-248.
14. M. MOLLOY, When does the giant component bring unsatisfiability?, Combinatorica, to appear.
15. Y. VERHOEVEN, Random 2-SAT and unsatisfiability, Inform. Proc. Lett., 72 (1999), pp. 119-123.
16. N. C. WORMALD, Differential Equations for random processes and random graphs, Ann. Appl. Probab., 5 (1995), pp. 1217-1235.