Exhaustive enumeration unveils clustering and freezing in random 3-SAT

Exhaustive enumeration unveils clustering and freezing in random 3-SAT

We study geometrical properties of the complete set of solutions of the random 3-satisfiability problem. We show that even for moderate system sizes the number of clusters corresponds surprisingly well with the theoretic asymptotic prediction. We locate the freezing transition in the space of soluti...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:arXiv.org 2008-04
Hauptverfasser: Ardelius, John, Zdeborová, Lenka
Format: Artikel
Sprache:eng
Schlagworte:
Clustering
Computer Science - Computational Complexity
Computer Science - Data Structures and Algorithms
Enumeration
Freezing
Physics - Disordered Systems and Neural Networks
Physics - Statistical Mechanics
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title arXiv.org
container_volume
creator Ardelius, John
Zdeborová, Lenka
description We study geometrical properties of the complete set of solutions of the random 3-satisfiability problem. We show that even for moderate system sizes the number of clusters corresponds surprisingly well with the theoretic asymptotic prediction. We locate the freezing transition in the space of solutions which has been conjectured to be relevant in explaining the onset of computational hardness in random constraint satisfaction problems.
doi_str_mv 10.48550/arxiv.0804.0362
format Article
fullrecord <record><control><sourceid>proquest_arxiv</sourceid><recordid>TN_cdi_arxiv_primary_0804_0362</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2090476803</sourcerecordid><originalsourceid>FETCH-LOGICAL-a932-7e7b01469265ae718d1bd2aee75fe6fa06c8c057e00023b86d0d7a03cee31ec53</originalsourceid><addsrcrecordid>eNotj81Lw0AUxBdBsNTePcmC58S3u9mPHEtptVDwYO5hk7zolmRTN02o_vUm1tPwZobH_Ah5YBAnRkp4tuHixhgMJDEIxW_IggvBIpNwfkdWfX8EAK40l1IsyG57-bRDf3YjUvRDi8GeXefp4Ed0TU_LZgoxOP9Bra9oHRB_5sN5Giaja6mI3tfZPbmtbdPj6l-XJNtts81rdHh72W_Wh8imgkcadQEsUSlX0qJmpmJFxS2iljWq2oIqTQlS47xQFEZVUGkLokQUDEspluTx-vaPMT8F19rwnc-s-cw6FZ6uhVPovgbsz_mxG4KfJuUcUki0MiDELwIQVsk</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2090476803</pqid></control><display><type>article</type><title>Exhaustive enumeration unveils clustering and freezing in random 3-SAT</title><source>arXiv.org</source><source>Free E- Journals</source><creator>Ardelius, John ; Zdeborová, Lenka</creator><creatorcontrib>Ardelius, John ; Zdeborová, Lenka</creatorcontrib><description>We study geometrical properties of the complete set of solutions of the random 3-satisfiability problem. We show that even for moderate system sizes the number of clusters corresponds surprisingly well with the theoretic asymptotic prediction. We locate the freezing transition in the space of solutions which has been conjectured to be relevant in explaining the onset of computational hardness in random constraint satisfaction problems.</description><identifier>EISSN: 2331-8422</identifier><identifier>DOI: 10.48550/arxiv.0804.0362</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Clustering ; Computer Science - Computational Complexity ; Computer Science - Data Structures and Algorithms ; Enumeration ; Freezing ; Physics - Disordered Systems and Neural Networks ; Physics - Statistical Mechanics</subject><ispartof>arXiv.org, 2008-04</ispartof><rights>2008. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,778,782,883,27908</link.rule.ids><backlink>$$Uhttps://doi.org/10.1103/PhysRevE.78.040101$$DView published paper (Access to full text may be restricted)$$Hfree_for_read</backlink><backlink>$$Uhttps://doi.org/10.48550/arXiv.0804.0362$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Ardelius, John</creatorcontrib><creatorcontrib>Zdeborová, Lenka</creatorcontrib><title>Exhaustive enumeration unveils clustering and freezing in random 3-SAT</title><title>arXiv.org</title><description>We study geometrical properties of the complete set of solutions of the random 3-satisfiability problem. We show that even for moderate system sizes the number of clusters corresponds surprisingly well with the theoretic asymptotic prediction. We locate the freezing transition in the space of solutions which has been conjectured to be relevant in explaining the onset of computational hardness in random constraint satisfaction problems.</description><subject>Clustering</subject><subject>Computer Science - Computational Complexity</subject><subject>Computer Science - Data Structures and Algorithms</subject><subject>Enumeration</subject><subject>Freezing</subject><subject>Physics - Disordered Systems and Neural Networks</subject><subject>Physics - Statistical Mechanics</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2008</creationdate><recordtype>article</recordtype><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GOX</sourceid><recordid>eNotj81Lw0AUxBdBsNTePcmC58S3u9mPHEtptVDwYO5hk7zolmRTN02o_vUm1tPwZobH_Ah5YBAnRkp4tuHixhgMJDEIxW_IggvBIpNwfkdWfX8EAK40l1IsyG57-bRDf3YjUvRDi8GeXefp4Ed0TU_LZgoxOP9Bra9oHRB_5sN5Giaja6mI3tfZPbmtbdPj6l-XJNtts81rdHh72W_Wh8imgkcadQEsUSlX0qJmpmJFxS2iljWq2oIqTQlS47xQFEZVUGkLokQUDEspluTx-vaPMT8F19rwnc-s-cw6FZ6uhVPovgbsz_mxG4KfJuUcUki0MiDELwIQVsk</recordid><startdate>20080414</startdate><enddate>20080414</enddate><creator>Ardelius, John</creator><creator>Zdeborová, Lenka</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20080414</creationdate><title>Exhaustive enumeration unveils clustering and freezing in random 3-SAT</title><author>Ardelius, John ; Zdeborová, Lenka</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a932-7e7b01469265ae718d1bd2aee75fe6fa06c8c057e00023b86d0d7a03cee31ec53</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2008</creationdate><topic>Clustering</topic><topic>Computer Science - Computational Complexity</topic><topic>Computer Science - Data Structures and Algorithms</topic><topic>Enumeration</topic><topic>Freezing</topic><topic>Physics - Disordered Systems and Neural Networks</topic><topic>Physics - Statistical Mechanics</topic><toplevel>online_resources</toplevel><creatorcontrib>Ardelius, John</creatorcontrib><creatorcontrib>Zdeborová, Lenka</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science &amp; Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection (ProQuest)</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection><collection>arXiv Computer Science</collection><collection>arXiv.org</collection><jtitle>arXiv.org</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Ardelius, John</au><au>Zdeborová, Lenka</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Exhaustive enumeration unveils clustering and freezing in random 3-SAT</atitle><jtitle>arXiv.org</jtitle><date>2008-04-14</date><risdate>2008</risdate><eissn>2331-8422</eissn><abstract>We study geometrical properties of the complete set of solutions of the random 3-satisfiability problem. We show that even for moderate system sizes the number of clusters corresponds surprisingly well with the theoretic asymptotic prediction. We locate the freezing transition in the space of solutions which has been conjectured to be relevant in explaining the onset of computational hardness in random constraint satisfaction problems.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><doi>10.48550/arxiv.0804.0362</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier EISSN: 2331-8422
ispartof arXiv.org, 2008-04
issn 2331-8422
language eng
recordid cdi_arxiv_primary_0804_0362
source arXiv.org; Free E- Journals
subjects Clustering
Computer Science - Computational Complexity
Computer Science - Data Structures and Algorithms
Enumeration
Freezing
Physics - Disordered Systems and Neural Networks
Physics - Statistical Mechanics
title Exhaustive enumeration unveils clustering and freezing in random 3-SAT
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-16T06%3A03%3A32IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_arxiv&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Exhaustive%20enumeration%20unveils%20clustering%20and%20freezing%20in%20random%203-SAT&rft.jtitle=arXiv.org&rft.au=Ardelius,%20John&rft.date=2008-04-14&rft.eissn=2331-8422&rft_id=info:doi/10.48550/arxiv.0804.0362&rft_dat=%3Cproquest_arxiv%3E2090476803%3C/proquest_arxiv%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2090476803&rft_id=info:pmid/&rfr_iscdi=true