{"id":"https://openalex.org/W2757068865","doi":"https://doi.org/10.1137/16m1065288","title":"Shortest Reconfiguration Paths in the Solution Space of Boolean Formulas","display_name":"Shortest Reconfiguration Paths in the Solution Space of Boolean Formulas","publication_year":2017,"publication_date":"2017-01-01","ids":{"openalex":"https://openalex.org/W2757068865","doi":"https://doi.org/10.1137/16m1065288","mag":"2757068865"},"language":"en","primary_location":{"id":"doi:10.1137/16m1065288","is_oa":false,"landing_page_url":"https://doi.org/10.1137/16m1065288","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":["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/A5051065386","display_name":"Amer E. Mouawad","orcid":"https://orcid.org/0000-0003-2481-4968"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Amer E. Mouawad","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5112513881","display_name":"Naomi Nishimura","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Naomi Nishimura","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5068735539","display_name":"Vinayak Pathak","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Vinayak Pathak","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5073311967","display_name":"Venkatesh Raman","orcid":"https://orcid.org/0000-0001-8123-0980"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Venkatesh Raman","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5051065386"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.3627,"has_fulltext":false,"cited_by_count":21,"citation_normalized_percentile":{"value":0.83192519,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"31","issue":"3","first_page":"2185","last_page":"2200"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998000264167786,"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.9998000264167786,"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/T11567","display_name":"semigroups and automata theory","score":0.9991000294685364,"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.9987999796867371,"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/mathematics","display_name":"Mathematics","score":0.7511719465255737},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6222481727600098},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6191917657852173},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5761197805404663},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.574289858341217},{"id":"https://openalex.org/keywords/boolean-data-type","display_name":"Boolean data type","score":0.4648773670196533},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.42952167987823486},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.2096162736415863}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7511719465255737},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6222481727600098},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6191917657852173},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5761197805404663},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.574289858341217},{"id":"https://openalex.org/C7342684","wikidata":"https://www.wikidata.org/wiki/Q520777","display_name":"Boolean data type","level":2,"score":0.4648773670196533},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.42952167987823486},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2096162736415863},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/16m1065288","is_oa":false,"landing_page_url":"https://doi.org/10.1137/16m1065288","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320334593","display_name":"Natural Sciences and Engineering Research Council of Canada","ror":"https://ror.org/01h531d29"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1970459509","https://openalex.org/W1976090101","https://openalex.org/W1982587570","https://openalex.org/W1997048861","https://openalex.org/W2006242427","https://openalex.org/W2055497246","https://openalex.org/W2129794490","https://openalex.org/W2145799305","https://openalex.org/W2912041544","https://openalex.org/W4232548171"],"related_works":["https://openalex.org/W2198982833","https://openalex.org/W2767202586","https://openalex.org/W4293054712","https://openalex.org/W2375775343","https://openalex.org/W2388654557","https://openalex.org/W2360981904","https://openalex.org/W2365712669","https://openalex.org/W2161960576","https://openalex.org/W1990043277","https://openalex.org/W2349797546"],"abstract_inverted_index":{"Given":[0],"a":[1,5,8,18,46,71,94,208,216],"Boolean":[2,59,86],"formula":[3],"and":[4,106,161,199,223],"satisfying":[6,48,53,78],"assignment,":[7],"flip":[9],"is":[10,110,164],"an":[11,57,135],"operation":[12],"that":[13,24,44,108,153,211],"changes":[14],"the":[15,21,25,32,36,64,68,97,101,121,138,149,155,179,188,194],"value":[16,157],"of":[17,34,39,56,66,70,73,85,99,104,124,197],"variable":[19],"in":[20,112,144,158,165],"assignment":[22,27,49,54],"so":[23,172],"resulting":[26],"remains":[28],"satisfying.":[29],"We":[30,88],"study":[31],"problem":[33],"computing":[35,178],"shortest":[37,102,129,139,180],"sequence":[38,72,103,131,140,150],"flips":[40,74,105,151],"(if":[41],"one":[42],"exists)":[43],"transforms":[45],"given":[47,77],"$s$":[50,160,198],"to":[51,92,120,167,214],"another":[52],"$t$":[55],"input":[58],"formula.":[60],"Earlier":[61],"work":[62],"characterized":[63],"complexity":[65,98,125],"deciding":[67],"existence":[69],"between":[75],"two":[76],"assignments":[79],"using":[80],"Schaefer's":[81],"framework":[82],"for":[83,96,128,177,185,228],"classification":[84],"formulas.":[87],"build":[89],"on":[90,207],"it":[91,109],"provide":[93],"trichotomy":[95],"finding":[100],"show":[107,213],"either":[111],"P,":[113],"NP-complete,":[114],"or":[115],"PSPACE-complete.":[116],"Our":[117,201],"result":[118],"adds":[119],"growing":[122],"set":[123,209],"results":[126],"known":[127,183],"reconfiguration":[130,169,230],"problems":[132,170,231],"by":[133],"providing":[134],"example":[136],"where":[137,174,187],"can":[141,224],"be":[142,215,226],"found":[143],"polynomial":[145],"time":[146],"even":[147],"though":[148],"variables":[152],"have":[154],"same":[156],"both":[159],"$t$.":[162,200],"This":[163],"contrast":[166],"most":[168],"studied":[171],"far,":[173],"polynomial-time":[175],"algorithms":[176],"path":[181,189],"were":[182],"only":[184],"cases":[186],"modified":[190],"no":[191],"more":[192],"than":[193],"symmetric":[195],"difference":[196],"proof":[202],"uses":[203],"Birkhoff's":[204],"representation":[205],"theorem":[206],"system":[210],"we":[212],"distributive":[217],"lattice.":[218],"The":[219],"technique":[220],"provides":[221],"insights":[222],"perhaps":[225],"used":[227],"other":[229],"as":[232],"well.":[233]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}