{"id":"https://openalex.org/W2000217912","doi":"https://doi.org/10.1137/100815530","title":"The Complexity of Symmetric Boolean Parity Holant Problems","display_name":"The Complexity of Symmetric Boolean Parity Holant Problems","publication_year":2013,"publication_date":"2013-01-01","ids":{"openalex":"https://openalex.org/W2000217912","doi":"https://doi.org/10.1137/100815530","mag":"2000217912"},"language":"en","primary_location":{"id":"doi:10.1137/100815530","is_oa":false,"landing_page_url":"https://doi.org/10.1137/100815530","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/A5100354396","display_name":"Heng Guo","orcid":"https://orcid.org/0000-0001-8199-5596"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Heng Guo","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5025408809","display_name":"Pinyan Lu","orcid":"https://orcid.org/0009-0005-0569-4122"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Pinyan Lu","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5015531084","display_name":"Leslie G. Valiant","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Leslie G. Valiant","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5100354396"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.8081,"has_fulltext":false,"cited_by_count":36,"citation_normalized_percentile":{"value":0.95086687,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"42","issue":"1","first_page":"324","last_page":"356"},"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/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/T11567","display_name":"semigroups and automata theory","score":0.9961000084877014,"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/combinatorics","display_name":"Combinatorics","score":0.7033296227455139},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6415923237800598},{"id":"https://openalex.org/keywords/homomorphism","display_name":"Homomorphism","score":0.6118952631950378},{"id":"https://openalex.org/keywords/subclass","display_name":"Subclass","score":0.6016113758087158},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5727526545524597},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.548815906047821},{"id":"https://openalex.org/keywords/parity","display_name":"Parity (physics)","score":0.5001888275146484},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.47734931111335754},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.4495101571083069},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.42777952551841736},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.17912748456001282}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7033296227455139},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6415923237800598},{"id":"https://openalex.org/C4042151","wikidata":"https://www.wikidata.org/wiki/Q215111","display_name":"Homomorphism","level":2,"score":0.6118952631950378},{"id":"https://openalex.org/C2776194381","wikidata":"https://www.wikidata.org/wiki/Q3965271","display_name":"Subclass","level":3,"score":0.6016113758087158},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5727526545524597},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.548815906047821},{"id":"https://openalex.org/C2777151079","wikidata":"https://www.wikidata.org/wiki/Q141160","display_name":"Parity (physics)","level":2,"score":0.5001888275146484},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.47734931111335754},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.4495101571083069},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.42777952551841736},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.17912748456001282},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C109214941","wikidata":"https://www.wikidata.org/wiki/Q18334","display_name":"Particle physics","level":1,"score":0.0},{"id":"https://openalex.org/C159654299","wikidata":"https://www.wikidata.org/wiki/Q79460","display_name":"Antibody","level":2,"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/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C203014093","wikidata":"https://www.wikidata.org/wiki/Q101929","display_name":"Immunology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/100815530","is_oa":false,"landing_page_url":"https://doi.org/10.1137/100815530","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":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1997649256","https://openalex.org/W2006912660","https://openalex.org/W2020273705","https://openalex.org/W2032292489","https://openalex.org/W2036481581","https://openalex.org/W2052936500","https://openalex.org/W2054076729","https://openalex.org/W2057512592","https://openalex.org/W2077574397","https://openalex.org/W2091345559","https://openalex.org/W2092436554","https://openalex.org/W2097738137","https://openalex.org/W2099255094","https://openalex.org/W2145707075","https://openalex.org/W2150339067","https://openalex.org/W2165676867","https://openalex.org/W2913798276","https://openalex.org/W3124201190"],"related_works":["https://openalex.org/W2153597031","https://openalex.org/W2161147766","https://openalex.org/W2001346827","https://openalex.org/W4299880090","https://openalex.org/W4206989225","https://openalex.org/W4253538798","https://openalex.org/W2049559029","https://openalex.org/W1271872764","https://openalex.org/W2000217912","https://openalex.org/W3177600251"],"abstract_inverted_index":{"For":[0,80],"certain":[1],"subclasses":[2,148],"of":[3,77,88,99,118,122,139],"NP,":[4,158],"$\\oplus$P,":[5,115],"or":[6,40],"#P":[7],"characterized":[8],"by":[9],"local":[10],"constraints,":[11],"it":[12],"is":[13,126,131],"known":[14],"that":[15,22,24,125],"if":[16],"there":[17],"exist":[18],"any":[19,123],"problems":[20,33,54],"within":[21,149],"subclass":[23,36],"are":[25,37],"not":[26,127],"polynomial":[27,128],"time":[28,129],"computable,":[29],"then":[30],"all":[31],"the":[32,35,73,86,97,108,113,140,154],"in":[34,96],"NP-complete,":[38],"$\\oplus$P-complete,":[39],"#P-complete.":[41],"Such":[42],"dichotomy":[43,70,109],"results":[44],"have":[45,92],"been":[46],"proved":[47],"for":[48,72,85,112,157,162],"characterizations":[49],"such":[50],"as":[51],"constraint":[52],"satisfaction":[53],"and":[55,57,143,160],"directed":[56],"undirected":[58],"graph":[59],"homomorphism":[60],"problems,":[61,90],"often":[62],"with":[63],"additional":[64],"restrictions.":[65],"Here":[66],"we":[67,106],"give":[68],"a":[69],"result":[71,105,134],"more":[74],"expressive":[75],"framework":[76],"Holant":[78,120],"problems.":[79],"example,":[81],"these":[82],"additionally":[83],"allow":[84],"expression":[87],"matching":[89],"which":[91],"had":[93],"pivotal":[94],"roles":[95],"development":[98],"complexity":[100],"theory.":[101],"As":[102],"our":[103],"main":[104],"prove":[107],"theorem":[110],"that,":[111],"class":[114,141],"every":[116],"set":[117],"symmetric":[119],"signatures":[121],"arities":[124],"computable":[130],"$\\oplus$P-complete.":[132],"The":[133],"exploits":[135],"some":[136],"special":[137],"properties":[138],"$\\oplus$P":[142],"characterizes":[144],"four":[145],"distinct":[146],"tractable":[147],"$\\oplus$P.":[150],"It":[151],"leaves":[152],"open":[153],"corresponding":[155],"questions":[156],"$\\#$P,":[159],"$\\#_k$P":[161],"$k\\neq":[163],"2$.":[164]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":3},{"year":2021,"cited_by_count":4},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":3}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}