{"id":"https://openalex.org/W2612406003","doi":"https://doi.org/10.1137/16m1073984","title":"Holographic Algorithms with Matchgates Capture Precisely Tractable Planar #CSP","display_name":"Holographic Algorithms with Matchgates Capture Precisely Tractable Planar #CSP","publication_year":2017,"publication_date":"2017-01-01","ids":{"openalex":"https://openalex.org/W2612406003","doi":"https://doi.org/10.1137/16m1073984","mag":"2612406003"},"language":"en","primary_location":{"id":"doi:10.1137/16m1073984","is_oa":false,"landing_page_url":"https://doi.org/10.1137/16m1073984","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"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 Computing","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/A5101599971","display_name":"Jin\u2010Yi Cai","orcid":"https://orcid.org/0009-0003-0675-6060"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jin-Yi Cai","raw_affiliation_strings":["University of Wisconsin-"],"affiliations":[{"raw_affiliation_string":"University of Wisconsin-","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5025408809","display_name":"Pinyan Lu","orcid":"https://orcid.org/0009-0005-0569-4122"},"institutions":[{"id":"https://openalex.org/I4210113369","display_name":"Microsoft Research Asia (China)","ror":"https://ror.org/0300m5276","country_code":"CN","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4210113369"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Pinyan Lu","raw_affiliation_strings":["Microsoft Research Asia"],"affiliations":[{"raw_affiliation_string":"Microsoft Research Asia","institution_ids":["https://openalex.org/I4210113369"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5105505784","display_name":"Mingji Xia","orcid":"https://orcid.org/0000-0002-3868-9910"},"institutions":[{"id":"https://openalex.org/I19820366","display_name":"Chinese Academy of Sciences","ror":"https://ror.org/034t30j35","country_code":"CN","type":"funder","lineage":["https://openalex.org/I19820366"]},{"id":"https://openalex.org/I4210128818","display_name":"Institute of Software","ror":"https://ror.org/033dfsn42","country_code":"CN","type":"facility","lineage":["https://openalex.org/I19820366","https://openalex.org/I4210128818"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Mingji Xia","raw_affiliation_strings":["Institute of Software, Chinese Academy of Sciences"],"affiliations":[{"raw_affiliation_string":"Institute of Software, Chinese Academy of Sciences","institution_ids":["https://openalex.org/I4210128818","https://openalex.org/I19820366"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5025408809"],"corresponding_institution_ids":["https://openalex.org/I4210113369"],"apc_list":null,"apc_paid":null,"fwci":1.4577,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.85109799,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"46","issue":"3","first_page":"853","last_page":"889"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":1.0,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":1.0,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"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.9997000098228455,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9983000159263611,"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/planar-graph","display_name":"Planar graph","score":0.6042166948318481},{"id":"https://openalex.org/keywords/counting-problem","display_name":"Counting problem","score":0.5573180913925171},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5325400233268738},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5053797364234924},{"id":"https://openalex.org/keywords/planar","display_name":"Planar","score":0.5035099387168884},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.48500725626945496},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.46818435192108154},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.4658167362213135},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4368976950645447},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.43259888887405396},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36877480149269104},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.33805644512176514},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.17067882418632507},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.10642525553703308}],"concepts":[{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.6042166948318481},{"id":"https://openalex.org/C16592021","wikidata":"https://www.wikidata.org/wiki/Q5177154","display_name":"Counting problem","level":2,"score":0.5573180913925171},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5325400233268738},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5053797364234924},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.5035099387168884},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.48500725626945496},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.46818435192108154},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.4658167362213135},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4368976950645447},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.43259888887405396},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36877480149269104},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.33805644512176514},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.17067882418632507},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.10642525553703308},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/16m1073984","is_oa":false,"landing_page_url":"https://doi.org/10.1137/16m1073984","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"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 Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1121271761","display_name":null,"funder_award_id":"Program","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"},{"id":"https://openalex.org/G3317480652","display_name":null,"funder_award_id":"Science","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"},{"id":"https://openalex.org/G547699461","display_name":null,"funder_award_id":"60970003","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"},{"id":"https://openalex.org/G6097371863","display_name":"Holographic Algorithms and Reductions","funder_award_id":"0830488","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6591889743","display_name":null,"funder_award_id":"CCF-0914969","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6794841274","display_name":null,"funder_award_id":"CCF-0830488","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7219699808","display_name":null,"funder_award_id":"CCF-0511679","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8244847624","display_name":"Some Problems in Complexity Theory","funder_award_id":"0511679","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G848032724","display_name":null,"funder_award_id":"Science","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8924900563","display_name":null,"funder_award_id":"CCF-1217549","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8935802037","display_name":null,"funder_award_id":"61003030","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"},{"id":"https://openalex.org/F4320335644","display_name":"Institute of Software, Chinese Academy of Sciences","ror":null}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W1653035750","https://openalex.org/W1660495057","https://openalex.org/W1980467407","https://openalex.org/W2000217912","https://openalex.org/W2006912660","https://openalex.org/W2009768419","https://openalex.org/W2012041962","https://openalex.org/W2032292489","https://openalex.org/W2036481581","https://openalex.org/W2040145343","https://openalex.org/W2045616322","https://openalex.org/W2056017121","https://openalex.org/W2065813152","https://openalex.org/W2074670256","https://openalex.org/W2086333739","https://openalex.org/W2091476331","https://openalex.org/W2115826669","https://openalex.org/W2118223706","https://openalex.org/W2145707075","https://openalex.org/W2173243501","https://openalex.org/W2227075066","https://openalex.org/W2570207426","https://openalex.org/W2913798276","https://openalex.org/W4213390282","https://openalex.org/W4252625889"],"related_works":["https://openalex.org/W4206327962","https://openalex.org/W3216105633","https://openalex.org/W1701875187","https://openalex.org/W2990956612","https://openalex.org/W1589381382","https://openalex.org/W961142965","https://openalex.org/W2089783325","https://openalex.org/W2767824041","https://openalex.org/W2061042466","https://openalex.org/W1979106445"],"abstract_inverted_index":{"Valiant":[0],"introduced":[1],"matchgate":[2,33],"computation":[3],"and":[4,35,100],"holographic":[5,36,173],"algorithms.":[6],"A":[7],"number":[8],"of":[9,49,89],"seemingly":[10],"exponential":[11],"time":[12,75,127],"problems":[13,51,64,162],"can":[14,101],"be":[15,102],"solved":[16],"by":[17,172],"this":[18,113],"novel":[19],"algorithmic":[20],"paradigm":[21],"in":[22,28,53,73,86,112,163],"polynomial":[23,74,126],"time.":[24],"We":[25,107],"show":[26],"that,":[27],"a":[29,42,46],"very":[30],"strong":[31],"sense,":[32],"computations":[34],"algorithms":[37,174],"based":[38],"on":[39,68,76,129,138,143,153,168],"them":[40],"provide":[41],"universal":[43],"methodology":[44],"to":[45,116],"broad":[47],"class":[48,114],"counting":[50,90],"studied":[52],"the":[54,87],"statistical":[55],"physics":[56],"community":[57],"for":[58],"decades.":[59],"They":[60],"capture":[61],"precisely":[62,117,171],"those":[63,121,134,148],"which":[65,122,135,149],"are":[66,123,136,150,159,166],"#P-hard":[67,137,151],"general":[69,130,139],"graphs":[70,140,170],"but":[71,141],"computable":[72],"planar":[77,144,154,169],"graphs.":[78,155],"More":[79],"precisely,":[80],"we":[81],"prove":[82,108],"complexity":[83],"dichotomy":[84],"theorems":[85],"framework":[88],"CSP":[91],"problems.":[92],"The":[93,156],"local":[94],"constraint":[95],"functions":[96],"take":[97],"Boolean":[98],"inputs":[99],"arbitrary":[103],"real-valued":[104],"symmetric":[105],"functions.":[106],"that":[109],"every":[110],"problem":[111],"belongs":[115],"three":[118],"categories:":[119],"(1)":[120],"tractable":[124,142,167],"(i.e.,":[125],"computable)":[128],"graphs,":[131,145],"or":[132,146],"(2)":[133,165],"(3)":[147],"even":[152],"classification":[157],"criteria":[158],"explicit.":[160],"Moreover,":[161],"category":[164],"with":[175],"matchgates.":[176]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":3}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}