{"id":"https://openalex.org/W3081543797","doi":"https://doi.org/10.1145/3647629","title":"On parity decision trees for Fourier-sparse Boolean functions","display_name":"On parity decision trees for Fourier-sparse Boolean functions","publication_year":2024,"publication_date":"2024-02-13","ids":{"openalex":"https://openalex.org/W3081543797","doi":"https://doi.org/10.1145/3647629","mag":"3081543797"},"language":"en","primary_location":{"id":"doi:10.1145/3647629","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3647629","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3647629","source":{"id":"https://openalex.org/S205019203","display_name":"ACM Transactions on Computation Theory","issn_l":"1942-3454","issn":["1942-3454","1942-3462"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computation Theory","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3647629","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5027137684","display_name":"Nikhil S. Mande","orcid":"https://orcid.org/0000-0002-9520-7340"},"institutions":[{"id":"https://openalex.org/I146655781","display_name":"University of Liverpool","ror":"https://ror.org/04xs57h96","country_code":"GB","type":"education","lineage":["https://openalex.org/I146655781"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Nikhil Shekhar Mande","raw_affiliation_strings":["University of Liverpool, Liverpool, United Kingdom"],"raw_orcid":"https://orcid.org/0000-0002-9520-7340","affiliations":[{"raw_affiliation_string":"University of Liverpool, Liverpool, United Kingdom","institution_ids":["https://openalex.org/I146655781"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5110947868","display_name":"Swagato Sanyal","orcid":"https://orcid.org/0000-0003-1546-7749"},"institutions":[{"id":"https://openalex.org/I145894827","display_name":"Indian Institute of Technology Kharagpur","ror":"https://ror.org/03w5sq511","country_code":"IN","type":"education","lineage":["https://openalex.org/I145894827"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Swagato Sanyal","raw_affiliation_strings":["Indian Institute of Technology Kharagpur, Kharagpur, India"],"raw_orcid":"https://orcid.org/0000-0003-1546-7749","affiliations":[{"raw_affiliation_string":"Indian Institute of Technology Kharagpur, Kharagpur, India","institution_ids":["https://openalex.org/I145894827"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.00289739,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"16","issue":"2","first_page":"1","last_page":"26"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998999834060669,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998999834060669,"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.9984999895095825,"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/T11130","display_name":"Coding theory and cryptography","score":0.9972000122070312,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/boolean-function","display_name":"Boolean function","score":0.802960991859436},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7376726269721985},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6923694610595703},{"id":"https://openalex.org/keywords/parity-function","display_name":"Parity function","score":0.688788652420044},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6441728472709656},{"id":"https://openalex.org/keywords/parity","display_name":"Parity (physics)","score":0.636146068572998},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5034992098808289},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.4998934268951416},{"id":"https://openalex.org/keywords/boolean-expression","display_name":"Boolean expression","score":0.171668142080307}],"concepts":[{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.802960991859436},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7376726269721985},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6923694610595703},{"id":"https://openalex.org/C188183281","wikidata":"https://www.wikidata.org/wiki/Q2898309","display_name":"Parity function","level":4,"score":0.688788652420044},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6441728472709656},{"id":"https://openalex.org/C2777151079","wikidata":"https://www.wikidata.org/wiki/Q141160","display_name":"Parity (physics)","level":2,"score":0.636146068572998},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5034992098808289},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.4998934268951416},{"id":"https://openalex.org/C158465420","wikidata":"https://www.wikidata.org/wiki/Q1979515","display_name":"Boolean expression","level":3,"score":0.171668142080307},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3647629","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3647629","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3647629","source":{"id":"https://openalex.org/S205019203","display_name":"ACM Transactions on Computation Theory","issn_l":"1942-3454","issn":["1942-3454","1942-3462"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computation Theory","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1145/3647629","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3647629","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3647629","source":{"id":"https://openalex.org/S205019203","display_name":"ACM Transactions on Computation Theory","issn_l":"1942-3454","issn":["1942-3454","1942-3462"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computation Theory","raw_type":"journal-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions","score":0.75}],"awards":[],"funders":[{"id":"https://openalex.org/F4320325536","display_name":"Indian Institute of Technology Kharagpur","ror":"https://ror.org/03w5sq511"},{"id":"https://openalex.org/F4320336003","display_name":"Sponsored Research and Industrial Consultancy","ror":null}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3081543797.pdf","grobid_xml":"https://content.openalex.org/works/W3081543797.grobid-xml"},"referenced_works_count":15,"referenced_works":["https://openalex.org/W68933255","https://openalex.org/W1951009694","https://openalex.org/W2066703250","https://openalex.org/W2099718824","https://openalex.org/W2145501841","https://openalex.org/W2148355440","https://openalex.org/W2282727044","https://openalex.org/W2787163834","https://openalex.org/W2901502347","https://openalex.org/W2901784899","https://openalex.org/W2982693763","https://openalex.org/W3036171685","https://openalex.org/W3102337263","https://openalex.org/W4297970684","https://openalex.org/W6682212160"],"related_works":["https://openalex.org/W2003722472","https://openalex.org/W2379318067","https://openalex.org/W2106622045","https://openalex.org/W2136871609","https://openalex.org/W1991921929","https://openalex.org/W2374311587","https://openalex.org/W2999312112","https://openalex.org/W2340850974","https://openalex.org/W2026024436","https://openalex.org/W4301915461"],"abstract_inverted_index":{"We":[0],"study":[1,12],"parity":[2,27],"decision":[3,28],"trees":[4],"for":[5,17],"Boolean":[6,47],"functions.":[7],"The":[8],"motivation":[9],"of":[10],"our":[11],"is":[13],"the":[14],"log-rank":[15],"conjecture":[16],"XOR":[18],"functions":[19],"and":[20,26,53],"its":[21],"connection":[22],"to":[23],"Fourier":[24,50,54],"analysis":[25],"tree":[29],"complexity.":[30],"Our":[31],"contributions":[32],"are":[33],"as":[34],"follows:":[35],"Let":[36],"\\(f":[37],":":[38],"\\mathbb":[39],"{F}_2^n":[40],"\\rightarrow":[41],"\\lbrace":[42],"-1,":[43],"1\\rbrace\\)":[44],"be":[45],"a":[46],"function":[48],"with":[49],"support":[51],"\ud835\udcae":[52],"sparsity":[55],"k":[56],".":[57]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}