{"id":"https://openalex.org/W2121804749","doi":"https://doi.org/10.2168/lmcs-6(4:4)2010","title":"The complexity of global cardinality constraints","display_name":"The complexity of global cardinality constraints","publication_year":2010,"publication_date":"2010-10-27","ids":{"openalex":"https://openalex.org/W2121804749","doi":"https://doi.org/10.2168/lmcs-6(4:4)2010","mag":"2121804749"},"language":"en","primary_location":{"id":"doi:10.2168/lmcs-6(4:4)2010","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-6(4:4)2010","pdf_url":"https://lmcs.episciences.org/1025/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://lmcs.episciences.org/1025/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5108247017","display_name":"Andre\u012d A. Bulatov","orcid":null},"institutions":[{"id":"https://openalex.org/I18014758","display_name":"Simon Fraser University","ror":"https://ror.org/0213rcc28","country_code":"CA","type":"education","lineage":["https://openalex.org/I18014758"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Andrei A. Bulatov","raw_affiliation_strings":["School of Computing Science, Simon Fraser University, Burnaby, Canada","Simon Fraser University"],"affiliations":[{"raw_affiliation_string":"School of Computing Science, Simon Fraser University, Burnaby, Canada","institution_ids":["https://openalex.org/I18014758"]},{"raw_affiliation_string":"Simon Fraser University","institution_ids":["https://openalex.org/I18014758"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5012849997","display_name":"D\u00e1niel Marx","orcid":"https://orcid.org/0000-0002-5686-8314"},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Daniel Marx","raw_affiliation_strings":["Tel-Aviv  University"],"affiliations":[{"raw_affiliation_string":"Tel-Aviv  University","institution_ids":["https://openalex.org/I16391192"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5108247017"],"corresponding_institution_ids":["https://openalex.org/I18014758"],"apc_list":null,"apc_paid":null,"fwci":2.3915,"has_fulltext":true,"cited_by_count":24,"citation_normalized_percentile":{"value":0.8893529,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"Volume 6, Issue 4","issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9994000196456909,"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"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9994000196456909,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9991000294685364,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9754999876022339,"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/cardinality","display_name":"Cardinality (data modeling)","score":0.873725414276123},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.7615357041358948},{"id":"https://openalex.org/keywords/constraint-satisfaction-dual-problem","display_name":"Constraint satisfaction dual problem","score":0.6827342510223389},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.6296242475509644},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.564041018486023},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.5390498042106628},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5342012643814087},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.466680645942688},{"id":"https://openalex.org/keywords/complexity-of-constraint-satisfaction","display_name":"Complexity of constraint satisfaction","score":0.4448429048061371},{"id":"https://openalex.org/keywords/constraint-logic-programming","display_name":"Constraint logic programming","score":0.4301174283027649},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4152827560901642},{"id":"https://openalex.org/keywords/local-consistency","display_name":"Local consistency","score":0.3966370224952698},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.39032286405563354},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.372372567653656},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.32247763872146606},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.32035788893699646},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.19954949617385864}],"concepts":[{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.873725414276123},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.7615357041358948},{"id":"https://openalex.org/C183046576","wikidata":"https://www.wikidata.org/wiki/Q5164380","display_name":"Constraint satisfaction dual problem","level":5,"score":0.6827342510223389},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.6296242475509644},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.564041018486023},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.5390498042106628},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5342012643814087},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.466680645942688},{"id":"https://openalex.org/C132180345","wikidata":"https://www.wikidata.org/wiki/Q5156628","display_name":"Complexity of constraint satisfaction","level":5,"score":0.4448429048061371},{"id":"https://openalex.org/C176783269","wikidata":"https://www.wikidata.org/wiki/Q5164378","display_name":"Constraint logic programming","level":4,"score":0.4301174283027649},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4152827560901642},{"id":"https://openalex.org/C137105694","wikidata":"https://www.wikidata.org/wiki/Q3407510","display_name":"Local consistency","level":4,"score":0.3966370224952698},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.39032286405563354},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.372372567653656},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.32247763872146606},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.32035788893699646},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.19954949617385864},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.2168/lmcs-6(4:4)2010","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-6(4:4)2010","pdf_url":"https://lmcs.episciences.org/1025/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1010.0201","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1010.0201","pdf_url":"https://arxiv.org/pdf/1010.0201","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.295.5403","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.295.5403","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.sfu.ca/~abulatov/papers/global.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.752.8168","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.752.8168","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/1010.0201.pdf","raw_type":"text"},{"id":"pmh:oai:doaj.org/article:c6a8c3e4141f4a508c12fe6f085a9339","is_oa":true,"landing_page_url":"https://doaj.org/article/c6a8c3e4141f4a508c12fe6f085a9339","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Logical Methods in Computer Science, Vol Volume 6, Issue 4 (2010)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.2168/lmcs-6(4:4)2010","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-6(4:4)2010","pdf_url":"https://lmcs.episciences.org/1025/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","score":0.41999998688697815,"display_name":"Reduced inequalities"}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2121804749.pdf","grobid_xml":"https://content.openalex.org/works/W2121804749.grobid-xml"},"referenced_works_count":28,"referenced_works":["https://openalex.org/W34906880","https://openalex.org/W1120761376","https://openalex.org/W1481022196","https://openalex.org/W1535978876","https://openalex.org/W1565722675","https://openalex.org/W1794401605","https://openalex.org/W1965377399","https://openalex.org/W1983032729","https://openalex.org/W1997649256","https://openalex.org/W2018470381","https://openalex.org/W2026753685","https://openalex.org/W2037479769","https://openalex.org/W2049582355","https://openalex.org/W2057256946","https://openalex.org/W2057872609","https://openalex.org/W2093461317","https://openalex.org/W2111829945","https://openalex.org/W2115218613","https://openalex.org/W2116407296","https://openalex.org/W2131358503","https://openalex.org/W2134850460","https://openalex.org/W2149922426","https://openalex.org/W2150339067","https://openalex.org/W2158985358","https://openalex.org/W2163982841","https://openalex.org/W2171142764","https://openalex.org/W2952861917","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W1486916474","https://openalex.org/W1519282274","https://openalex.org/W2091348864","https://openalex.org/W1536604285","https://openalex.org/W2569549435","https://openalex.org/W2784687883","https://openalex.org/W2032348095","https://openalex.org/W2096689540","https://openalex.org/W115413730","https://openalex.org/W2073925063"],"abstract_inverted_index":{"In":[0],"a":[1,14,39],"constraint":[2,26,51],"satisfaction":[3,52],"problem":[4,48,53],"(CSP)":[5],"the":[6,44,47,50,63,87],"goal":[7],"is":[8,27],"to":[9,20,78],"find":[10],"an":[11,28],"assignment":[12],"of":[13,17,46,69],"given":[15],"set":[16,64],"variables":[18,35],"subject":[19],"specified":[21],"constraints.":[22],"A":[23],"global":[24,55],"cardinality":[25,56],"additional":[29],"requirement":[30],"that":[31,58,75,86],"prescribes":[32],"how":[33],"many":[34],"must":[36],"be":[37],"assigned":[38],"certain":[40],"value.":[41],"We":[42],"study":[43],"complexity":[45],"CCSP(G),":[49],"with":[54],"constraints":[57],"allows":[59],"only":[60],"relations":[61],"from":[62],"G.":[65],"The":[66],"main":[67],"result":[68],"this":[70],"paper":[71],"characterizes":[72],"sets":[73],"G":[74],"give":[76],"rise":[77],"problems":[79,90],"solvable":[80],"in":[81],"polynomial":[82],"time,":[83],"and":[84],"states":[85],"remaining":[88],"such":[89],"are":[91],"NP-complete.":[92]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":6},{"year":2016,"cited_by_count":7},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}