NDLI: Random 3-SAT: The Plot Thickens

Please wait, while we are loading the content...

Random 3-SAT: The Plot Thickens

Content Provider	Springer Nature Link
Author	Coarfa, Cristian Demopoulos, Demetrios D. San Miguel Aguirre, Alfonso Subramanian, Devika Vardi, Moshe Y.
Copyright Year	2003
Abstract	This paper presents an experimental investigation of the following questions: how does the average-case complexity of random 3-SAT, understood as a function of the order (number of variables) for fixed density (ratio of number of clauses to order) instances, depend on the density? Is there a phase transition in which the complexity shifts from polynomial to exponential in the order? Is the transition dependent or independent of the solver? Our experiment design uses three complete SAT solvers embodying different algorithms: GRASP, CPLEX, and CUDD. We observe new phase transitions for all three solvers, where the median running time shifts from polynomial in the order to exponential. The location of the phase transition appears to be solver-dependent. GRASP shifts from polynomial to exponential complexity near the density of 3.8, CPLEX shifts near density 3, while CUDD exhibits this transition between densities of 0.1 and 0.5. This experimental result underscores the dependence between the solver and the complexity phase transition, and challenges the widely held belief that random 3-SAT exhibits a phase transition in computational complexity very close to the crossover point.
Starting Page	243
Ending Page	261
Page Count	19
File Format	PDF
ISSN	13837133
Journal	Constraints
Volume Number	8
Issue Number	3
e-ISSN	15729354
Language	English
Publisher	Kluwer Academic Publishers
Publisher Date	2003-01-01
Publisher Place	Boston
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Computing Methodologies Artificial Intelligence (incl. Robotics) Optimization Operation Research/Decision Theory
Content Type	Text
Resource Type	Article
Subject	Discrete Mathematics and Combinatorics Artificial Intelligence Computational Theory and Mathematics Software

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Beyond the structure of SAT formulas

Decision diagrams for optimization

Towards next generation sequential and parallel SAT solvers

New techniques for discrete optimization

Editor’s note

Quantified maximum satisfiability

Probabilistic constraint reasoning

Constraints meet concurrency

Instance-specific algorithm configuration

Random 3-SAT: The Plot Thickens

Similar Documents

Beyond the structure of SAT formulas

Decision diagrams for optimization

Towards next generation sequential and parallel SAT solvers

New techniques for discrete optimization

Editor’s note

Quantified maximum satisfiability

Probabilistic constraint reasoning

Constraints meet concurrency

Instance-specific algorithm configuration

Random 3-SAT: The Plot Thickens