{"id":"https://openalex.org/W2028733517","doi":"https://doi.org/10.1016/s0304-3975(98)00343-0","title":"Boolean constraint satisfaction: complexity results for optimization problems with arbitrary weights","display_name":"Boolean constraint satisfaction: complexity results for optimization problems with arbitrary weights","publication_year":2000,"publication_date":"2000-08-01","ids":{"openalex":"https://openalex.org/W2028733517","doi":"https://doi.org/10.1016/s0304-3975(98)00343-0","mag":"2028733517"},"language":"en","primary_location":{"id":"doi:10.1016/s0304-3975(98)00343-0","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0304-3975(98)00343-0","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"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/A5101920004","display_name":"Peter J\u00f6nsson","orcid":"https://orcid.org/0000-0002-5288-3330"},"institutions":[{"id":"https://openalex.org/I102134673","display_name":"Link\u00f6ping University","ror":"https://ror.org/05ynxx418","country_code":"SE","type":"education","lineage":["https://openalex.org/I102134673"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"Peter Jonsson","raw_affiliation_strings":["Department of Computer and Information Science, Link\u00f6pings Universitet, S-581 83 Link\u00f6ping, Sweden","Link\u00f6pings Univ., Link\u00f6ping, Sweden#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer and Information Science, Link\u00f6pings Universitet, S-581 83 Link\u00f6ping, Sweden","institution_ids":["https://openalex.org/I102134673"]},{"raw_affiliation_string":"Link\u00f6pings Univ., Link\u00f6ping, Sweden#TAB#","institution_ids":["https://openalex.org/I102134673"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5101920004"],"corresponding_institution_ids":["https://openalex.org/I102134673"],"apc_list":{"value":2690,"currency":"USD","value_usd":2690},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":{"value":0.15228951,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"244","issue":"1-2","first_page":"189","last_page":"203"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9995999932289124,"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.9995999932289124,"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.9947999715805054,"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.9922000169754028,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/constraint-satisfaction-dual-problem","display_name":"Constraint satisfaction dual problem","score":0.7283780574798584},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.724686861038208},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6282323598861694},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5252938866615295},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.5216270089149475},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5179244875907898},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4882652759552002},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.46081680059432983},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.45732298493385315},{"id":"https://openalex.org/keywords/boolean-data-type","display_name":"Boolean data type","score":0.4546601474285126},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.43442195653915405},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.43378329277038574},{"id":"https://openalex.org/keywords/l-reduction","display_name":"L-reduction","score":0.43090397119522095},{"id":"https://openalex.org/keywords/local-consistency","display_name":"Local consistency","score":0.3451167047023773},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.31499266624450684},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2705265283584595},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.25448381900787354},{"id":"https://openalex.org/keywords/continuous-optimization","display_name":"Continuous optimization","score":0.21540281176567078}],"concepts":[{"id":"https://openalex.org/C183046576","wikidata":"https://www.wikidata.org/wiki/Q5164380","display_name":"Constraint satisfaction dual problem","level":5,"score":0.7283780574798584},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.724686861038208},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6282323598861694},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5252938866615295},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.5216270089149475},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5179244875907898},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4882652759552002},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.46081680059432983},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.45732298493385315},{"id":"https://openalex.org/C7342684","wikidata":"https://www.wikidata.org/wiki/Q520777","display_name":"Boolean data type","level":2,"score":0.4546601474285126},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.43442195653915405},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.43378329277038574},{"id":"https://openalex.org/C62114133","wikidata":"https://www.wikidata.org/wiki/Q5366944","display_name":"L-reduction","level":5,"score":0.43090397119522095},{"id":"https://openalex.org/C137105694","wikidata":"https://www.wikidata.org/wiki/Q3407510","display_name":"Local consistency","level":4,"score":0.3451167047023773},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.31499266624450684},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2705265283584595},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.25448381900787354},{"id":"https://openalex.org/C92995354","wikidata":"https://www.wikidata.org/wiki/Q5165499","display_name":"Continuous optimization","level":4,"score":0.21540281176567078},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","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/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","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/C122357587","wikidata":"https://www.wikidata.org/wiki/Q6934508","display_name":"Multi-swarm optimization","level":3,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1016/s0304-3975(98)00343-0","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0304-3975(98)00343-0","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.26.8634","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.26.8634","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://ftp.ida.liu.se/pub/labs/tcslab/petej/Journal/J15/J15.ps","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W86044744","https://openalex.org/W1963547452","https://openalex.org/W2009955311","https://openalex.org/W2033040247","https://openalex.org/W2041756370","https://openalex.org/W2053913299","https://openalex.org/W2077575555","https://openalex.org/W2091345559","https://openalex.org/W2093128520","https://openalex.org/W2116634999","https://openalex.org/W2117290960","https://openalex.org/W2166566648","https://openalex.org/W2569646339","https://openalex.org/W2795674018","https://openalex.org/W3022694456","https://openalex.org/W4210524419","https://openalex.org/W4233558979","https://openalex.org/W6603474794","https://openalex.org/W6776658741"],"related_works":["https://openalex.org/W1593899949","https://openalex.org/W3151692304","https://openalex.org/W2123500285","https://openalex.org/W2365854838","https://openalex.org/W2011875321","https://openalex.org/W2180856585","https://openalex.org/W2129131081","https://openalex.org/W2134850460","https://openalex.org/W2247877609","https://openalex.org/W2028733517"],"abstract_inverted_index":null,"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}