{"id":"https://openalex.org/W2101773938","doi":"https://doi.org/10.1109/sfcs.2003.1238207","title":"The resolution complexity of random constraint satisfaction problems","display_name":"The resolution complexity of random constraint satisfaction problems","publication_year":2004,"publication_date":"2004-03-02","ids":{"openalex":"https://openalex.org/W2101773938","doi":"https://doi.org/10.1109/sfcs.2003.1238207","mag":"2101773938"},"language":"en","primary_location":{"id":"doi:10.1109/sfcs.2003.1238207","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sfcs.2003.1238207","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings.","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://utoronto.scholaris.ca/bitstreams/20057f9e-3b9c-4e2d-9293-f5033dfc26bc/download","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5072889645","display_name":"Michael Molloy","orcid":"https://orcid.org/0000-0001-5435-1015"},"institutions":[{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]},{"id":"https://openalex.org/I4210153468","display_name":"Microsoft (Canada)","ror":"https://ror.org/04xhxg104","country_code":"CA","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4210153468"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"M. Molloy","raw_affiliation_strings":["Department of Computer Science, University of Toronto and Microsoft Research, Canada"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Toronto and Microsoft Research, Canada","institution_ids":["https://openalex.org/I185261750","https://openalex.org/I4210153468"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5010339836","display_name":"Mohammad R. Salavatipour","orcid":"https://orcid.org/0000-0002-7650-2045"},"institutions":[{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"M. Salavatipour","raw_affiliation_strings":["Department of Computer Science, University of Toronto, Canada"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Toronto, Canada","institution_ids":["https://openalex.org/I185261750"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5072889645"],"corresponding_institution_ids":["https://openalex.org/I185261750","https://openalex.org/I4210153468"],"apc_list":null,"apc_paid":null,"fwci":3.2407,"has_fulltext":true,"cited_by_count":16,"citation_normalized_percentile":{"value":0.92887235,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"31","issue":null,"first_page":"330","last_page":"339"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.9883000254631042,"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/T11727","display_name":"Advanced Algebra and Logic","score":0.9871000051498413,"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/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.8460173606872559},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.6550162434577942},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.5954495668411255},{"id":"https://openalex.org/keywords/resolution","display_name":"Resolution (logic)","score":0.5884824991226196},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5685818791389465},{"id":"https://openalex.org/keywords/random-variable","display_name":"Random variable","score":0.5670340061187744},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5469789505004883},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5421115159988403},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5220041871070862},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5056653022766113},{"id":"https://openalex.org/keywords/variable","display_name":"Variable (mathematics)","score":0.49803781509399414},{"id":"https://openalex.org/keywords/constraint-satisfaction-dual-problem","display_name":"Constraint satisfaction dual problem","score":0.4885624349117279},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.47156426310539246},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.4428633153438568},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4232731759548187},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.4171733856201172},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3811896741390228},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36806005239486694},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3053938150405884},{"id":"https://openalex.org/keywords/local-consistency","display_name":"Local consistency","score":0.27602970600128174},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.19538140296936035},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.10882630944252014},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.07590535283088684},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.07305437326431274}],"concepts":[{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.8460173606872559},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.6550162434577942},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.5954495668411255},{"id":"https://openalex.org/C138268822","wikidata":"https://www.wikidata.org/wiki/Q1051925","display_name":"Resolution (logic)","level":2,"score":0.5884824991226196},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5685818791389465},{"id":"https://openalex.org/C122123141","wikidata":"https://www.wikidata.org/wiki/Q176623","display_name":"Random variable","level":2,"score":0.5670340061187744},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5469789505004883},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5421115159988403},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5220041871070862},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5056653022766113},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.49803781509399414},{"id":"https://openalex.org/C183046576","wikidata":"https://www.wikidata.org/wiki/Q5164380","display_name":"Constraint satisfaction dual problem","level":5,"score":0.4885624349117279},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.47156426310539246},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.4428633153438568},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4232731759548187},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.4171733856201172},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3811896741390228},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36806005239486694},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3053938150405884},{"id":"https://openalex.org/C137105694","wikidata":"https://www.wikidata.org/wiki/Q3407510","display_name":"Local consistency","level":4,"score":0.27602970600128174},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.19538140296936035},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.10882630944252014},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.07590535283088684},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.07305437326431274},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1109/sfcs.2003.1238207","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sfcs.2003.1238207","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings.","raw_type":"proceedings-article"},{"id":"pmh:oai:localhost:1807/9463","is_oa":true,"landing_page_url":"http://hdl.handle.net/1807/9463","pdf_url":"https://utoronto.scholaris.ca/bitstreams/20057f9e-3b9c-4e2d-9293-f5033dfc26bc/download","source":{"id":"https://openalex.org/S4306400261","display_name":"TSpace (University of Toronto)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I185261750","host_organization_name":"University of Toronto","host_organization_lineage":["https://openalex.org/I185261750"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.5.6828","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.5.6828","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.toronto.edu/~mreza/research/cspresjnl2.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.576.9561","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.576.9561","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"https://tspace.library.utoronto.ca/bitstream/1807/9463/3/the resolution complexity of random.....pdf","raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:localhost:1807/9463","is_oa":true,"landing_page_url":"http://hdl.handle.net/1807/9463","pdf_url":"https://utoronto.scholaris.ca/bitstreams/20057f9e-3b9c-4e2d-9293-f5033dfc26bc/download","source":{"id":"https://openalex.org/S4306400261","display_name":"TSpace (University of Toronto)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I185261750","host_organization_name":"University of Toronto","host_organization_lineage":["https://openalex.org/I185261750"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article"},"sustainable_development_goals":[{"score":0.44999998807907104,"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2101773938.pdf","grobid_xml":"https://content.openalex.org/works/W2101773938.grobid-xml"},"referenced_works_count":33,"referenced_works":["https://openalex.org/W73861168","https://openalex.org/W807724727","https://openalex.org/W1514397520","https://openalex.org/W1541044193","https://openalex.org/W1969966778","https://openalex.org/W1971378428","https://openalex.org/W2000931246","https://openalex.org/W2004472922","https://openalex.org/W2013181989","https://openalex.org/W2018251959","https://openalex.org/W2018277172","https://openalex.org/W2044722214","https://openalex.org/W2069767473","https://openalex.org/W2071706116","https://openalex.org/W2084384424","https://openalex.org/W2097113315","https://openalex.org/W2098022011","https://openalex.org/W2110254595","https://openalex.org/W2113680569","https://openalex.org/W2126420408","https://openalex.org/W2136558174","https://openalex.org/W2138778293","https://openalex.org/W2139300273","https://openalex.org/W2143404729","https://openalex.org/W2147012241","https://openalex.org/W2151266168","https://openalex.org/W2160560721","https://openalex.org/W2176203587","https://openalex.org/W2478722229","https://openalex.org/W2951758740","https://openalex.org/W3123481344","https://openalex.org/W3144881883","https://openalex.org/W6632270856"],"related_works":["https://openalex.org/W2091348864","https://openalex.org/W2569549435","https://openalex.org/W2161128834","https://openalex.org/W2784687883","https://openalex.org/W1550482496","https://openalex.org/W2012141606","https://openalex.org/W3122034878","https://openalex.org/W2137855809","https://openalex.org/W2295056692","https://openalex.org/W1527777107"],"abstract_inverted_index":{"We":[0],"consider":[1],"random":[2],"instances":[3],"of":[4,44,50],"constraint":[5,17],"satisfaction":[6],"problems":[7],"where":[8,62],"each":[9,16,25],"variable":[10],"has":[11],"domain":[12],"size":[13],"d,":[14],"and":[15],"contains":[18],"t":[19],"restrictions":[20],"on":[21],"k":[22],"variables.":[23,45],"For":[24,46],"(d,":[26,51],"k,":[27,52],"t)":[28,53],"we":[29,54],"determine":[30,55],"whether":[31],"the":[32,42,63,74],"resolution":[33,60,64],"complexity":[34,61,65],"is":[35],"a.s.":[36,68,71],"constant,":[37],"polynomial":[38,72],"or":[39],"exponential":[40,69],"in":[41],"number":[43],"a":[47,56,78],"particular":[48],"range":[49],"sharp":[57],"threshold":[58],"for":[59],"drops":[66],"from":[67],"to":[70],"when":[73],"clause":[75],"density":[76],"passes":[77],"specific":[79],"value.":[80]},"counts_by_year":[{"year":2016,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}