(Enter summary)
Abstract: Let OE be a random Boolean formula that is an instance of
3-SAT. We consider the problem of computing the least real number
such that if the ratio of the number of clauses over the number of variables
of OE strictly exceeds , then OE is almost certainly unsatisfiable. By
a well known and more or less straightforward argument, it can be shown
that 5:191. This upper bound was improved by Kamath, Motwani,
Palem, and Spirakis to 4.758, by first providing new improved bounds
for the... (Update)
Cited by: More
Almost All Graphs with 2.522n Edges Are Not 3-Colorable - Achlioptas, Molloy
(Correct)
Hiding Satisfying Assignments: Two are Better than One - Achlioptas, Jia, Moore
(Correct)
The Threshold for Random k-SAT is 2^k log 2 - O(k) - Achlioptas, Peres (2004)
(Correct)
Similar documents (at the sentence level):
55.4%: Approximating the Unsatisfiability Threshold of.. - Kirousis, Kranakis.. (1996)
(Correct)
28.0%: A Better Upper Bound for the Unsatisfiability Threshold - Kirousis, Kranakis, Krizanc (1996)
(Correct)
Active bibliography (related documents): More All
0.2: Toward A Good Algorithm for Determining Unsatisfiability of .. - Franco, Swaminathan (1995)
(Correct)
0.2: Random Constraint Satisfaction: A More Accurate Picture - Achlioptas, Kirousis.. (1998)
(Correct)
0.2: The Probabilistic Analysis of a Greedy Satisfiability.. - Kaporis, Kirousis, Lalas (2002)
(Correct)
Similar documents based on text: More All
0.6: A Correlation Inequality and Its Application to a Word .. - Achlioptas, Kirousis, .. (1996)
(Correct)
0.5: Rigorous Results for Random (2+p)-SAT - Achlioptas, Kirousis, Kranakis.. (1997)
(Correct)
0.5: Power Consumption in Packet Radio Networks (Extended Abstract) - Kirousis, al. (1996)
(Correct)
Related documents from co-citation: More All
31: Analysis of two simple heuristics for random instances of k-SAT
- Frieze, Suen - 1996
20: Probabilistic analysis of a generalization of the unit-clause literal selection .. (context) - Chao, Franco - 1990
18: the satisfiability and maximum satisfiability of random 3CNF formulas (context) - Broder, Frieze et al. - 1993
BibTeX entry: (Update)
L. Kirousis, E. Kranakis, and D. Krizanc, "Approximating the Unsatisfiability Threshold of Random Formulas," Technical Report, Carleton University, TR-95-26, Ottawa, Canada, 1995. http://citeseer.ist.psu.edu/kirousis95approximating.html More
@article{ kirousis98approximating,
author = "Lefteris M. Kirousis and Evangelos Kranakis and Danny Krizanc and Yannis C. Stamatiou",
title = "Approximating the unsatisfiability threshold of random formulas",
journal = "Random Structures and Algorithms",
volume = "12",
number = "3",
pages = "253-269",
year = "1998",
url = "citeseer.ist.psu.edu/kirousis95approximating.html" }
Citations (may not include all citations):
2003
The Art of Computer Programming (context) - Knuth, Algorithms - 1973
230
Handbook of Mathematical Functions With Formulas (context) - Abramowitz, Stegun - 1972
81
Encyclopedia of Mathematics and its Applications (context) - Gasper, Rahman et al. - 1990
81
Critical behavior in the satisfiability of random Boolean ex..
- Kirkpatrick, Selman - 1994
72
Many hard examples for resolution (context) - Chv'atal, Szemer'edi - 1988
65
Probabilistic analysis of the Davis-Putnam procedure for sol.. (context) - Franco, Paull - 1983
57
Tail bounds for occupancy and the satisfiability threshold c..
- Kamath, Motwani et al. - 1994
34
Poisson approximation for large deviations (context) - Janson - 1990
33
The Maple Handbook: Maple V Release (context) - Redfern - 1994
8
The harmonic mean formula for probabilities of unions: appli.. (context) - Aldous - 1989
5
Etude statistique de l' existence de solutions de probl`emes.. (context) - Simon, Carlier et al. - 1986
5
An Upper Bound for a Basic Hypergeometric Series
- Kirousis, Kranakis et al. - 1996
4
Mick gets some (the odds are on his side (context) - Chv'atal, Reed - 1992
1
This article was processed using the L T E X macro package w.. (context) - Spencer, on et al. - 1994
1
A Correlation Inequality and Its Application to a Word Probl..
- Achlioptas, Kirousis et al.
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.scs.carleton.ca/~kranakis/papers.html): More
Improving Customer Proximity to Railway Stations - Kranakis, Penna, Schlude..
(Correct)
Distributed Computing On Anonymous Hypercubes With Faulty.. - Kranakis, Santoro (1992)
(Correct)
The eXtended Satellite Transport Protocol: Its Design.. - Elaasar, Li, Barbeau, .. (2003)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC