{"id":"https://openalex.org/W7097656629","doi":null,"title":"Computational Complexity and Phase Transitions (Extended Abstract)","display_name":"Computational Complexity and Phase Transitions (Extended Abstract)","alternate_titles":[],"publication_year":null,"publication_date":null,"ids":{"openalex":"https://openalex.org/W7097656629"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.341.5138","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.341.5138","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/cs/0005032v1.pdf","raw_type":"text"},"parent_works":[],"lineage":["https://openalex.org/W7097656629"],"child_works_count":0,"type":"preprint","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5028188667","display_name":"Gabriel Istrate","orcid":"https://orcid.org/0000-0001-6179-7613","observed_orcids":["https://orcid.org/0000-0001-6179-7613"]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Gabriel Istrate","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5028188667"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9359999895095825,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9359999895095825,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.04619999974966049,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.010400000028312206,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/phase-transitions","display_name":"phase transitions","score":0.8270000219345093},{"id":"https://openalex.org/keywords/sharp-threshold","display_name":"sharp threshold","score":0.8389999866485596},{"id":"https://openalex.org/keywords/computational-complexity","display_name":"computational complexity","score":0.8679999709129333},{"id":"https://openalex.org/keywords/np-completeness","display_name":"NP-completeness","score":0.8840000033378601},{"id":"https://openalex.org/keywords/hard-instances","display_name":"hard instances","score":0.6209999918937683},{"id":"https://openalex.org/keywords/combinatorial-problems","display_name":"combinatorial problems","score":0.7300000190734863},{"id":"https://openalex.org/keywords/statistical-mechanics","display_name":"statistical mechanics","score":0.546999990940094}],"concepts":[{"id":"https://openalex.org/C162838799","wikidata":"https://www.wikidata.org/wiki/Q596077","display_name":"Counterexample","level":2,"score":0.8553000092506409},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.75},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6581000089645386},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.6233000159263611},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.5228000283241272},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5196999907493591},{"id":"https://openalex.org/C149288129","wikidata":"https://www.wikidata.org/wiki/Q185357","display_name":"Phase transition","level":2,"score":0.5052000284194946},{"id":"https://openalex.org/C13355873","wikidata":"https://www.wikidata.org/wiki/Q2920850","display_name":"Connection (principal bundle)","level":2,"score":0.4848000109195709},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4318999946117401},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.41839998960494995},{"id":"https://openalex.org/C152062344","wikidata":"https://www.wikidata.org/wiki/Q818888","display_name":"Computability","level":2,"score":0.3926999866962433},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.38019999861717224},{"id":"https://openalex.org/C99874945","wikidata":"https://www.wikidata.org/wiki/Q188715","display_name":"Statistical mechanics","level":2,"score":0.3691999912261963},{"id":"https://openalex.org/C121864883","wikidata":"https://www.wikidata.org/wiki/Q677916","display_name":"Statistical physics","level":1,"score":0.3546999990940094},{"id":"https://openalex.org/C111797529","wikidata":"https://www.wikidata.org/wiki/Q17080584","display_name":"Maximum satisfiability problem","level":3,"score":0.3343000113964081},{"id":"https://openalex.org/C44280652","wikidata":"https://www.wikidata.org/wiki/Q104837","display_name":"Phase (matter)","level":2,"score":0.328000009059906},{"id":"https://openalex.org/C19754495","wikidata":"https://www.wikidata.org/wiki/Q3435924","display_name":"Computational problem","level":2,"score":0.313400000333786},{"id":"https://openalex.org/C115988155","wikidata":"https://www.wikidata.org/wiki/Q3262192","display_name":"Decision problem","level":2,"score":0.2822999954223633},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.28029999136924744},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.275299996137619},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2734000086784363},{"id":"https://openalex.org/C115908005","wikidata":"https://www.wikidata.org/wiki/Q2668364","display_name":"Combinatorial explosion","level":2,"score":0.257099986076355},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2515999972820282}],"mesh":[],"locations_count":1,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.341.5138","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.341.5138","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/cs/0005032v1.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W1903055627","https://openalex.org/W7096403173","https://openalex.org/W7097788299","https://openalex.org/W7097903308","https://openalex.org/W2033086906","https://openalex.org/W807724727","https://openalex.org/W2494800483","https://openalex.org/W7099285392","https://openalex.org/W2309956788","https://openalex.org/W1650993530"],"abstract_inverted_index":{"Phase":[0],"transitions":[1,30],"in":[2,13,34,51],"combinatorial":[3,18],"problems":[4,89],"have":[5,78,91],"recently":[6],"been":[7,32],"shown":[8],"[2]":[9,37],"to":[10],"be":[11,121],"useful":[12],"locating":[14],"\u201chard\u201d":[15],"instances":[16],"of":[17,28,58,64,102,111],"problems.":[19],"The":[20],"connection":[21],"between":[22],"computational":[23],"complexity":[24],"and":[25,38],"the":[26,56,62,73,86,100,103,109],"existence":[27,57],"phase":[29],"has":[31],"addressed":[33],"Statistical":[35],"Mechanics":[36],"Artificial":[39],"Intelligence":[40],"[3],":[41],"but":[42],"not":[43,98],"studied":[44],"rigorously.":[45],"We":[46],"take":[47],"a":[48,79,92,128],"first":[49],"step":[50],"this":[52],"direction":[53],"by":[54,69,127],"investigating":[55],"sharp":[59,93],"thresholds":[60],"for":[61],"class":[63,110],"generalized":[65,87],"satisfiability":[66,88],"problems,":[67],"defined":[68],"Schaefer":[70],"[4].":[71],"In":[72],"case":[74],"when":[75],"all":[76,117],"constraints":[77],"special":[80],"clausal":[81],"form":[82],"we":[83],"completely":[84],"characterize":[85],"that":[90,108],"threshold.":[94],"While":[95],"NP-completeness":[96],"does":[97],"imply":[99],"sharpness":[101],"threshold,":[104],"our":[105],"result":[106],"suggests":[107],"counterexamples":[112,119],"is":[113],"rather":[114],"limited,":[115],"as":[116],"such":[118],"can":[120],"predicted,":[122],"with":[123],"constant":[124],"success":[125],"probability":[126],"single":[129],"procedure.":[130]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W7097656629","counts_by_year":[],"updated_date":"2026-11-12T12:28:57.059296","created_date":"2025-10-27T00:00:00"}
