{"id":"https://openalex.org/W2481874986","doi":"https://doi.org/10.1137/16m1088107","title":"Binarisation for Valued Constraint Satisfaction Problems","display_name":"Binarisation for Valued Constraint Satisfaction Problems","publication_year":2017,"publication_date":"2017-01-01","ids":{"openalex":"https://openalex.org/W2481874986","doi":"https://doi.org/10.1137/16m1088107","mag":"2481874986"},"language":"en","primary_location":{"id":"doi:10.1137/16m1088107","is_oa":false,"landing_page_url":"https://doi.org/10.1137/16m1088107","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1608.01628","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"David A. Cohen","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"David A. Cohen","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Martin C. Cooper","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Martin C. Cooper","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Peter G. Jeavons","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Peter G. Jeavons","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Andrei Krokhin","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Andrei Krokhin","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Robert Powell","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Robert Powell","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Stanislav \u017divn\u00fd","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Stanislav \u017divn\u00fd","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.1956,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.60139611,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"31","issue":"4","first_page":"2279","last_page":"2300"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.7526000142097473,"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.7526000142097473,"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.1965000033378601,"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/T10142","display_name":"Formal Methods in Verification","score":0.01679999940097332,"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.8170999884605408},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.7105000019073486},{"id":"https://openalex.org/keywords/homomorphism","display_name":"Homomorphism","score":0.6776000261306763},{"id":"https://openalex.org/keywords/constraint-satisfaction-dual-problem","display_name":"Constraint satisfaction dual problem","score":0.6294999718666077},{"id":"https://openalex.org/keywords/complexity-of-constraint-satisfaction","display_name":"Complexity of constraint satisfaction","score":0.6118999719619751},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.6037999987602234},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.5529999732971191},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.5514000058174133},{"id":"https://openalex.org/keywords/dual","display_name":"Dual (grammatical number)","score":0.4593000113964081}],"concepts":[{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.8170999884605408},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.7105000019073486},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6845999956130981},{"id":"https://openalex.org/C4042151","wikidata":"https://www.wikidata.org/wiki/Q215111","display_name":"Homomorphism","level":2,"score":0.6776000261306763},{"id":"https://openalex.org/C183046576","wikidata":"https://www.wikidata.org/wiki/Q5164380","display_name":"Constraint satisfaction dual problem","level":5,"score":0.6294999718666077},{"id":"https://openalex.org/C132180345","wikidata":"https://www.wikidata.org/wiki/Q5156628","display_name":"Complexity of constraint satisfaction","level":5,"score":0.6118999719619751},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.6037999987602234},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.5529999732971191},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.5514000058174133},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.4593000113964081},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.44589999318122864},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.43540000915527344},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.42340001463890076},{"id":"https://openalex.org/C9376300","wikidata":"https://www.wikidata.org/wiki/Q168817","display_name":"Algebraic number","level":2,"score":0.42260000109672546},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.4041000008583069},{"id":"https://openalex.org/C176783269","wikidata":"https://www.wikidata.org/wiki/Q5164378","display_name":"Constraint logic programming","level":4,"score":0.3619999885559082},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.35350000858306885},{"id":"https://openalex.org/C79475747","wikidata":"https://www.wikidata.org/wiki/Q4913885","display_name":"Binary constraint","level":5,"score":0.35010001063346863},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3467999994754791},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.34150001406669617},{"id":"https://openalex.org/C137105694","wikidata":"https://www.wikidata.org/wiki/Q3407510","display_name":"Local consistency","level":4,"score":0.3278999924659729},{"id":"https://openalex.org/C156884757","wikidata":"https://www.wikidata.org/wiki/Q798554","display_name":"Backtracking","level":2,"score":0.3140999972820282},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3107999861240387},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.3084000051021576},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.2962000072002411},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.28220000863075256},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.27129998803138733},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.27090001106262207},{"id":"https://openalex.org/C2778023678","wikidata":"https://www.wikidata.org/wiki/Q554403","display_name":"Duality (order theory)","level":2,"score":0.27079999446868896},{"id":"https://openalex.org/C63435697","wikidata":"https://www.wikidata.org/wiki/Q864135","display_name":"Binary code","level":3,"score":0.2614000141620636},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.257999986410141},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.25040000677108765}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1137/16m1088107","is_oa":false,"landing_page_url":"https://doi.org/10.1137/16m1088107","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"},{"id":"pmh:oai:dro.dur.ac.uk.OAI2:23193","is_oa":false,"landing_page_url":"http://dro.dur.ac.uk/23193/","pdf_url":null,"source":{"id":"https://openalex.org/S4306400188","display_name":"Durham Research Online (Durham University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I190082696","host_organization_name":"Durham University","host_organization_lineage":["https://openalex.org/I190082696"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"SIAM journal on discrete mathematics, 2017, Vol.31(4), pp.2279-2300 [Peer Reviewed Journal]","raw_type":"Article"},{"id":"pmh:oai:arXiv.org:1608.01628","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1608.01628","pdf_url":"https://arxiv.org/pdf/1608.01628","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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:HAL:hal-01646073v1","is_oa":true,"landing_page_url":"https://hal.science/hal-01646073","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SIAM Journal on Discrete Mathematics, 2017, vol. 31 (n\u00b0 4), pp. 2279-2300. ⟨10.1137/16M1088107⟩","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:durham-repository.worktribe.com:1348303","is_oa":true,"landing_page_url":"https://durham-repository.worktribe.com/output/1348303","pdf_url":null,"source":{"id":"https://openalex.org/S4306400188","display_name":"Durham Research Online (Durham University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I190082696","host_organization_name":"Durham University","host_organization_lineage":["https://openalex.org/I190082696"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Journal Article"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1608.01628","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1608.01628","pdf_url":"https://arxiv.org/pdf/1608.01628","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3202555970","display_name":null,"funder_award_id":"714532","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G3640746038","display_name":null,"funder_award_id":"EP/L020394/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G434337789","display_name":null,"funder_award_id":"HORIZON2020","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G6036067684","display_name":"Constraint Network Tractability: Beyond Structure and Language","funder_award_id":"EP/L021226/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G6618579952","display_name":null,"funder_award_id":"EP/H000666/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G7917444926","display_name":null,"funder_award_id":"EP/L021226/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G8430430141","display_name":"Power of Algorithms in Discrete Optimisation","funder_award_id":"714532","funder_id":"https://openalex.org/F4320338335","funder_display_name":"H2020 European Research Council"}],"funders":[{"id":"https://openalex.org/F4320320006","display_name":"Royal Society","ror":"https://ror.org/03wnrjx87"},{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"},{"id":"https://openalex.org/F4320338335","display_name":"H2020 European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W1543513027","https://openalex.org/W1976017655","https://openalex.org/W1983032729","https://openalex.org/W1983818015","https://openalex.org/W1988961015","https://openalex.org/W1997649256","https://openalex.org/W1999038767","https://openalex.org/W2003272326","https://openalex.org/W2026753685","https://openalex.org/W2032487621","https://openalex.org/W2034079307","https://openalex.org/W2049143039","https://openalex.org/W2052726983","https://openalex.org/W2053242449","https://openalex.org/W2071152266","https://openalex.org/W2077575555","https://openalex.org/W2115305364","https://openalex.org/W2115373747","https://openalex.org/W2116407296","https://openalex.org/W2119456262","https://openalex.org/W2128059732","https://openalex.org/W2146959334","https://openalex.org/W2150339067","https://openalex.org/W2318083694","https://openalex.org/W2411816729","https://openalex.org/W2613504727","https://openalex.org/W2950298732","https://openalex.org/W2964303025","https://openalex.org/W2964332764","https://openalex.org/W4230754665"],"related_works":[],"abstract_inverted_index":{"We":[0],"study":[1],"methods":[2],"for":[3],"transforming":[4],"valued":[5,66],"constraint":[6,67],"satisfaction":[7],"problems":[8,75],"(VCSPs)":[9],"to":[10,42,56,72],"binary":[11,43],"VCSPs.":[12,34,57],"First,":[13],"we":[14,36],"show":[15],"that":[16,28,61],"the":[17,25,30,38],"standard":[18],"dual":[19],"encoding":[20],"preserves":[21],"many":[22],"aspects":[23],"of":[24,33,40],"algebraic":[26],"properties":[27],"capture":[29],"computational":[31],"complexity":[32],"Second,":[35],"extend":[37],"reduction":[39,59],"CSPs":[41,44],"described":[45],"by":[46],"Bul\u00edn":[47],"et":[48],"al.":[49],"[Log.":[50],"Methods":[51],"Comput.":[52],"Sci.,":[53],"11":[54],"(2015)]":[55],"This":[58],"establishes":[60],"VCSPs":[62],"over":[63,76],"a":[64,77],"fixed":[65,78],"language":[68],"are":[69],"polynomial-time":[70],"equivalent":[71],"minimum-cost":[73],"homomorphism":[74],"digraph.":[79]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2026-08-05T07:39:15.569665","created_date":"2016-08-23T00:00:00"}