Delaying satisfiability for random 2SAT

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6302 LNCS, Issue , 2010, Pages 710-723

  Sinclair, Alistair ^a   Vilenchik, Dan ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 78149349559     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-15369-3_53     Document Type: Conference Paper

References (18)

1. Apswall, B., Plass, M., Tarjan, R.: A linear-time algorithm for testing the truth of certain quantified Boolean formulas. Inf. Proc. Letters 8, 121-123 (1979)
2. Azar, Y., Broder, A., Karlin, A., Upfal, E.: Balanced allocations. SIAM Journal on Computing 29(1), 180-200 (1999)
3. Bohman, T., Frieze, A.: Avoiding a giant component. Random Structures & Algorithms 19(1), 75-85 (2001)
4. Bohman, T., Frieze, A., Wormald, N.: Avoidance of a giant component in half the edge set of a random graph. Random Structures & Algorithms 25(4), 432-449 (2004) (Pubitemid 40031648)
5. Bohman, T., Kim, J.H.: A phase transition for avoiding a giant component. Random Structures & Algorithms 28(2), 195-214 (2006) (Pubitemid 43401383)
6. Bohman, T., Kravitz, D.: Creating a giant component. Combinatorics, Probability and Computing 15(4), 489-511 (2006)
7. Broder, A., Frieze, A., Upfal, E.: On the satisfiability and maximum satisfiability of random 3CNF formulas. In: Proc. 4th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 322-330 (1993)
8. Chvátal, V., Reed, B.: Mick gets some (the odds are on his side). In: Proc. 33rd IEEE Symposium on Foundations of Computer Science (FOCS), pp. 620-627 (1992)
9. Erdös, P., Rényi, A.: On the evolution of random graphs. Publ. Math. Inst. Hung. Acad. Sci. 5, 17-61 (1960)
10. Flaxman, A., Gamarnik, D., Sorkin, G.: Embracing the giant component. Random Structures & Algorithms 27(3), 277-289 (2005)
11. Friedgut, E.: Sharp thresholds of graph properties and the k-SAT problem. Journal of the American Mathematical Society 12(4), 1017-1054 (1998)
12. Frieze, A., Wormald, N.: Random k-Sat: A tight threshold for moderately growing k. Combinatorica 25(3), 297-305 (2005)
13. Goerdt, A.: A threshold for unsatisfiability. Journal of Computer and System Sciences 53(3), 469-486 (1996)
14. Kirkpatrick, S., Selman, B.: Critical behavior in the satisfiability of random Boolean expressions. Science 264, 1297-1301 (1994) (Pubitemid 24220129)
15. Kravitz, D.: Random 2SAT does not depend on a giant. SIAM Journal on Discrete Mathematics 21(2), 408-422 (2007)
16. Krivelevich, M., Loh, P., Sudakov, B.: Avoiding small subgraphs in Achlioptas processes. Random Structures & Algorithms 34(1), 165-195 (2009)
17. Krivelevich, M., Lubetzky, E., Sudakov, B.: Hamiltonicity thresholds in Achlioptas processes. In: Random Structures & Algorithms (to appear)
18. Spencer, J., Wormald, N.: Birth control for giants. Combinatorica 27(5), 587-628 (2007)