NDLI: Algorithmic Barriers from Phase Transitions

Content Provider	IEEE Xplore Digital Library
Author	Achlioptas, D. Coja-Oghlan, A.
Copyright Year	2008
Description	Author affiliation: UC Santa Cruz, Santa Cruz, CA (Achlioptas, D.) \|\| Sch. of Inf., Univ. of Edinburgh, Edinburgh (Coja-Oghlan, A.)
Abstract	For many random constraint satisfaction problems, by now there exist asymptotically tight estimates of the largest constraint density for which solutions exist. At the same time, for many of these problems, all known polynomial-time algorithms stop finding solutions at much smaller densities. For example, it is well-known that it is easy to color a random graph using twice as many colors as its chromatic number. Indeed, some of the simplest possible coloring algorithms achieve this goal. Given the simplicity of those algorithms, one would expect room for improvement. Yet, to date, no algorithm is known that uses (2 - epsiv)chi colors, in spite of efforts by numerous researchers over the years. In view of the remarkable resilience of this factor of 2 against every algorithm hurled at it, we find it natural to inquire into its origin. We do so by analyzing the evolution of the set of k-colorings of a random graph, viewed as a subset of $\{1,...,k\}^{n},$ as edges are added. We prove that the factor of 2 corresponds in a precise mathematical sense to a phase transition in the geometry of this set. Roughly speaking, we prove that the set of k-colorings looks like a giant ball for k ges 2chi, but like an error-correcting code for k les (2 - epsiv)chi. We also prove that an analogous phase transition occurs both in random k-SAT and in random hypergraph 2-coloring. And that for each of these three problems, the location of the transition corresponds to the point where all known polynomial-time algorithms fail. To prove our results we develop a general technique that allows us to establish rigorously much of the celebrated 1-step replica-symmetry-breaking hypothesis of statistical physics for random CSPs.
Starting Page	793
Ending Page	802
File Size	325187
Page Count	10
File Format	PDF
ISBN	9780769534367
ISSN	02725428
DOI	10.1109/FOCS.2008.11
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2008-10-25
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Polynomials Upper bound Computer science Phase estimation Resilience Geometry Error correction codes Physics Injuries Moment methods Algorithms Phase Transitions Random Constraint Satisfaction Problems
Content Type	Text
Resource Type	Article

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

Further error event diagram reduction using algorithmic techniques

On Covering Polynomials for Binary Cyclic Codes

The Satisfiability Threshold for a Seemingly Intractable Random Constraint Satisfaction Problem

Phase Transitions and Computational Difficulty in Random Constraint Satisfaction Problems

Algorithmic Barriers from Phase Transitions

On the distance distribution of duals of BCH codes

On upper bounds for the distance of codes of small size

Phase transitions and computational difficulty in random constraint satisfaction problems (2008)

On spectra of BCH codes

Algorithmic Barriers from Phase Transitions

Similar Documents

Further error event diagram reduction using algorithmic techniques

On Covering Polynomials for Binary Cyclic Codes

The Satisfiability Threshold for a Seemingly Intractable Random Constraint Satisfaction Problem

Phase Transitions and Computational Difficulty in Random Constraint Satisfaction Problems

Algorithmic Barriers from Phase Transitions

On the distance distribution of duals of BCH codes

On upper bounds for the distance of codes of small size

Phase transitions and computational difficulty in random constraint satisfaction problems (2008)

On spectra of BCH codes

Algorithmic Barriers from Phase Transitions