Article

Free access

Setting 2 variables at a time yields a new lower bound for random 3-SAT (extended abstract)

Author:

Dimitris AchlioptasAuthors Info & Claims

STOC '00: Proceedings of the thirty-second annual ACM symposium on Theory of computing

Pages 28 - 37

https://doi.org/10.1145/335305.335309

Published: 01 May 2000 Publication History

PDF eReader

References

[1]

D. Achlioptas, L. M. Kirousis, E. Kranakis, and D. Krizanc. Rigorous results for random (2 +p)-SAT. In Proceedings of RALCOM 97 (Santorini, Greece), pages 1-13, 1997. Submitted to Theoret. Comput. Sci.

Google Scholar

[2]

P. Beame and T. Pitassi. Propositional proof complexity: past, present, and future. Bull. Eur. Assoc. Theor. Comput. Sci. EATCS, (65):66-89, 1998.

Google Scholar

[3]

B. Bollobfis, C. Borgs, J. Chayes, J. H. Kim, and D. B. Wilson. The scaling window of the 2-SAT transition. Manuscript, 1999.

Google Scholar

[4]

A. Z. Broder, A. M. Frieze, and E. Upfal. On the satisfiability and maximum satisfiability of random 3-CNF formulas. In dth Annual A CM-SIAM Symposium on Discrete Algorithms (Austin, TX, 1993), pages 322- 330. ACM, New York, 1993.

Digital Library

Google Scholar

[5]

M.-T. Chao and J. Franco. Probabilistic analysis of two heuristics for the 3-satisfiability problem. SIAM J. Comput., 15(4):1106-1118, 1986.

Digital Library

Google Scholar

[6]

V. Chv~tal and B. Reed. Mick gets some (the odds are on his side). In 33th Annual Symposium on Foundations o/Computer Science (Pittsburgh, PA, 199~), pages 620-627. iEEE Comput. Soc. Press, Los Alamitos, CA, 1992.

Digital Library

Google Scholar

[7]

V. Chv,4tal and E. Szemer~di. Many hard examples for resolution. J. Assoc. Comput. Mach., 35(4):759-768, 1988.

Digital Library

Google Scholar

[8]

S. A. Cook. The complexity of theorem-proving procedures. In 3rd Annual A CM Symposium on Theory of Computing (Shaker Heights, OH, 1971), pages 151-158. ACM, New York, 1971.

Digital Library

Google Scholar

[9]

S. A. Cook and D. G. Mitchell. Finding hard instances of the satisfiability problem: a survey. In Satisfiability problem: theory and applications (Piscataway, N J, 1996), pages 1-17. Amer. Math. Soc., Providence, RI, 1997.

Google Scholar

[10]

M. Davis, G. Logemann, and D. Loveland. A machine program for theorem-proving. Comm. A CM, 5:394-397, 1962.

Digital Library

Google Scholar

[11]

M. Davis and H. Putnam. A computing procedure for quantification theory. J. Assoc. Comput. Mach., 7:201- 215, 1960.

Digital Library

Google Scholar

[12]

O. Dubois and Y. Boufkhaxt. A general upper bound for the satisfiability threshold of random r-SAT formulae. J. Algorithms, 24(2):395-420, 1997.

Digital Library

Google Scholar

[13]

O. Dubois, Y. Boufkhad, and J. Mandler. Typical random 3-SAT formulae and the satisfiability threshold. In 11th Annual ACM-$IAM Symposium on Discrete Algorithms (San Francisco, CA, 2000), pages 126-127. ACM, New York, 2000.

Digital Library

Google Scholar

[14]

A. El Maftouhi and W. Fernandez de la Vega. On random 3-SAT. Combin. Probab. Comput., 4(3):189-195, 1995.

Crossref

Google Scholar

[15]

W. Fernandez de la Vega. On random 2-SAT. 1992. Manuscript.

Google Scholar

[16]

J. Franco. Probabilistic analysis of the pure literal heuristic for the satisfiability problem. Ann. Oper. Res., 1:273-289, 1984.

Crossref

Google Scholar

[17]

J. Franco and M. Paul1. Probabilistic analysis of the Davis-Putnam procedure for solving the satisftability problem. Discrete Appl. Math., 5(1):77-87, 1983.

Crossref

Google Scholar

[18]

E. Friedgut. Necessary and sufficient conditions for sharp thresholds of graph properties, and the k-SAT problem. J. Amer. Math. Soc., 12:1017-1054, 1999.

Crossref

Google Scholar

[19]

A. M. Frieze and S. Suen. Analysis of two simple heuristics on a random instance of k-SAT. J. Algorithms, 20(2):312-355, 1996.

Digital Library

Google Scholar

[20]

A. Goerdt. A threshold for unsatisfiability. J. Comput. System Sci., 53(3):469-486, 1996.

Digital Library

Google Scholar

[21]

A. Goldberg. On the complexity of the satisfiability problem. In jth Workshop on Automated Deduction (Austin, TX, 1979), pages 1-6, 1979.

Google Scholar

[22]

A. Haken. The intractability of resolution. Theoret. Comput. Sci., 39(2-3):297-308, 1985.

Crossref

Google Scholar

[23]

S. Janson, Y. C. Stamatiou, and M. Vamwakari. Bounding the unsatisfiability threshold of random 3-SAT. 1999. Submitted.

Google Scholar

[24]

A. Kamath, R. Motwani, K. Palem, and P. Spirakis. Tail bounds for occupancy and the satisfiability threshold conjecture. Random Structures Algorithms, 7(1):59- 80, 1995.

Digital Library

Google Scholar

[25]

R. Karp and M. Sipser. Maximum matchings in sparse random graphs. In 2~nd Annual Symposium on Foundations of Computer Science, pages 364-375. IEEE Cornput. Soc. Press, Los Alamitos, CA, 1981.

Google Scholar

[26]

L. M. Kirousis, E. Kranakis, D. Krizanc, and Y. Sta~ matiou. Approximating the unsatisfiability threshold of random formulas. Random Structures Algorithms, !2(3):253-269, 1998.

Digital Library

Google Scholar

[27]

T. G. Kurtz. Solutions of ordinary differential equations as limits of pure jump Markov processes. J. Appl. Probability, 7:49-58, 1970.

Crossref

Google Scholar

[28]

T. G. Kurtz. Approximation of population processes. Society for Industrial and Applied Mathematics (SIAM), Philadelphia, Pa., 1981.

Google Scholar

[29]

A. W. Marshall and I. Olkin. Inequalities: theory of majorization and its applications. Academic Press Inc. {Harcourt Brace Jovanovich Publishers}, New York, 1979.

Google Scholar

[30]

R. Monasson and R. Zecchina. Entropy of the K- satisfiability problem. Phys. Rev. Left., 76(21):3881- 3885, 1996.

Crossref

Google Scholar

[31]

R. Monasson and R. Zecchina. Statistical mechanics of the random K-satisfiability model. Phys. Rev. E (3), 56(2):1357-1370, 1997.

Crossref

Google Scholar

[32]

R. Monasson and R. Zecchina. Tricritical points in random combinatorics: the (2 + p)-SAT case. J. Phys. A, 1998. submitted.

Crossref

Google Scholar

[33]

R. Monasson, R. Zecchina, S. Kirkpatrick, B. Selman, and L. Troyansky. Phase transition and search cost in the (2 + p)-SAT problem. In Jth Workshop on Physics and Computation, (Boston, MA, 1996).

Google Scholar

[34]

R. Monasson, R. Zecchina, S. Kirkpatrick, B. Selman, and L. Troyansky. Determining computational complexity from characteristic phase transitions. Nature, 400:133-137, 1999.

Crossref

Google Scholar

[35]

N. Nedialkov. Computing Rigorous Bounds on the Solution of an Initial Value Problem for an Ordinary Differential Equation. Ph.D. Thesis, University of Toronto, 1999.

Digital Library

Google Scholar

[36]

D. Redfern. The Maple Handbook: Maple V Release 3. Springer Verlag, New York, third edition, 1994.

Digital Library

Google Scholar

[37]

B. Selman, D. G. Mitchell, and H. J. Levesque. Generating hard satisfiability problems. Artificial Intelligence, 81(1-2):17-29, 1996.

Digital Library

Google Scholar

[38]

N. C. Wormald. Differential equations for random processes and random graphs. Ann. Appl. Probab., 5(4):1217-1235, 1995.

Crossref

Google Scholar

Cited By

View all

Haque MTozal M(2022)Negative Insurance Claim Generation Using Distance Pooling on Positive Diagnosis-Procedure Bipartite GraphsJournal of Data and Information Quality10.1145/353134714:3(1-26)Online publication date: 23-May-2022
https://dl.acm.org/doi/10.1145/3531347
Zheng ZZheng LAlipourlangouri MChiang FGolab LSzlichta JBaskaran S(2022)Contextual Data Cleaning with Ontology Functional DependenciesJournal of Data and Information Quality10.1145/352430314:3(1-26)Online publication date: 23-May-2022
https://dl.acm.org/doi/10.1145/3524303
Demetrescu CFinocchi IRibichini ASchaerf M(2022)Which Conference Is That? A Case Study in Computer ScienceJournal of Data and Information Quality10.1145/351903114:3(1-13)Online publication date: 23-May-2022
https://dl.acm.org/doi/10.1145/3519031
Show More Cited By

Index Terms

Setting 2 variables at a time yields a new lower bound for random 3-SAT (extended abstract)

Recommendations

Solving MAX-r-SAT above a tight lower bound
SODA '10: Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete algorithms

We present an exact algorithm that decides, for every fixed r ≥ 2 in time O(m) + 2^O(k2) whether a given set of m clauses of size r admits a truth assignment that satisfies at least ((2^r - 1)m + k)/2^r clauses. Thus Max-r-Sat is fixed-parameter tractable ...
2-Local Random Reductions to 3-Valued Functions

Yao (in a lecture at DIMACS Workshop on structural complexity and cryptography, 1990) showed that if a language L is 2-locally random reducible to a Boolean function, then L ∈ PSPACE/poly. Fortnow & Szegedy quantitatively improved Yao’s result to show ...
Almost 2-SAT Is Fixed-Parameter Tractable (Extended Abstract)
ICALP '08: Proceedings of the 35th international colloquium on Automata, Languages and Programming - Volume Part I

We consider the following problem. Given a <Emphasis Type="SmallCaps">2-cnf</Emphasis>formula, is it possible to remove at most kclauses so that the resulting <Emphasis Type="SmallCaps">2-cnf</Emphasis>formula is satisfiable? This problem is known to ...

Comments

Information & Contributors

Information

Published In

STOC '00: Proceedings of the thirty-second annual ACM symposium on Theory of computing

May 2000

756 pages

ISBN:1581131844

DOI:10.1145/335305

Chairmen:
Frances Yao,
Eugene Luks

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 May 2000

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

STOC00

Sponsor:

SIGACT

STOC00: The 32nd Annual ACM Symposium on Theory of Computing

May 21 - 23, 2000

Oregon, Portland, USA

Acceptance Rates

STOC '00 Paper Acceptance Rate 85 of 182 submissions, 47%;

Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

53
Total Citations
View Citations
421
Total Downloads

Downloads (Last 12 months)61
Downloads (Last 6 weeks)8

Reflects downloads up to 01 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Haque MTozal M(2022)Negative Insurance Claim Generation Using Distance Pooling on Positive Diagnosis-Procedure Bipartite GraphsJournal of Data and Information Quality10.1145/353134714:3(1-26)Online publication date: 23-May-2022
https://dl.acm.org/doi/10.1145/3531347
Zheng ZZheng LAlipourlangouri MChiang FGolab LSzlichta JBaskaran S(2022)Contextual Data Cleaning with Ontology Functional DependenciesJournal of Data and Information Quality10.1145/352430314:3(1-26)Online publication date: 23-May-2022
https://dl.acm.org/doi/10.1145/3524303
Demetrescu CFinocchi IRibichini ASchaerf M(2022)Which Conference Is That? A Case Study in Computer ScienceJournal of Data and Information Quality10.1145/351903114:3(1-13)Online publication date: 23-May-2022
https://dl.acm.org/doi/10.1145/3519031
Graf TLemire D(2022)Binary Fuse Filters: Fast and Smaller Than Xor FiltersACM Journal of Experimental Algorithmics10.1145/351044927(1-15)Online publication date: 4-Mar-2022
https://dl.acm.org/doi/10.1145/3510449
Cook DStrickland MSchmitter-Edgecombe M(2022)Detecting Smartwatch-Based Behavior Change in Response to a Multi-Domain Brain Health InterventionACM Transactions on Computing for Healthcare10.1145/35080203:3(1-18)Online publication date: 7-Apr-2022
https://dl.acm.org/doi/10.1145/3508020
Ramos Nde Jesus Rde Rezende Pde Souza CUsberti F(2022)Triangle-Based Heuristics for Area Optimal PolygonizationsACM Journal of Experimental Algorithmics10.1145/350400127(1-25)Online publication date: 25-May-2022
https://dl.acm.org/doi/10.1145/3504001
Demaine EFekete SKeldenich PKrupke DMitchell J(2022)Area-Optimal Simple Polygonalizations: The CG Challenge 2019ACM Journal of Experimental Algorithmics10.1145/350400027(1-12)Online publication date: 4-Mar-2022
https://dl.acm.org/doi/10.1145/3504000
Fekete SHaas AKeldenich PPerk MSchmidt A(2022)Computing Area-Optimal Simple PolygonizationsACM Journal of Experimental Algorithmics10.1145/350360727(1-23)Online publication date: 25-May-2022
https://dl.acm.org/doi/10.1145/3503607
Wu RDas NChaba SGandhi SChau DChu X(2022)A Cluster-then-label Approach for Few-shot Learning with Application to Automatic Image Data LabelingJournal of Data and Information Quality10.1145/349123214:3(1-23)Online publication date: 23-May-2022
https://dl.acm.org/doi/10.1145/3491232
Alyahya TMenai MMathkour H(2022)On the Structure of the Boolean Satisfiability Problem: A SurveyACM Computing Surveys10.1145/349121055:3(1-34)Online publication date: 30-Mar-2022
https://dl.acm.org/doi/10.1145/3491210
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Solving MAX-r-SAT above a tight lower bound

2-Local Random Reductions to 3-Valued Functions

Almost 2-SAT Is Fixed-Parameter Tractable (Extended Abstract)

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

References

Cited By

Index Terms

Recommendations

Solving MAX-r-SAT above a tight lower bound

2-Local Random Reductions to 3-Valued Functions

Almost 2-SAT Is Fixed-Parameter Tractable (Extended Abstract)

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations