{"id":"https://openalex.org/W2009813398","doi":"https://doi.org/10.1145/1536414.1536437","title":"Testing juntas nearly optimally","display_name":"Testing juntas nearly optimally","publication_year":2009,"publication_date":"2009-05-31","ids":{"openalex":"https://openalex.org/W2009813398","doi":"https://doi.org/10.1145/1536414.1536437","mag":"2009813398"},"language":"en","primary_location":{"id":"doi:10.1145/1536414.1536437","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1536414.1536437","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-first annual ACM symposium on Theory of computing","raw_type":"proceedings-article"},"type":"conference-paper","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/A5000042413","display_name":"Eric Blais","orcid":"https://orcid.org/0009-0000-5824-9034"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Eric Blais","raw_affiliation_strings":["Carnegie Mellon University, Pittsburgh, PA, USA","Carnegie-Mellon University, Pittsburgh, Pa., USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]},{"raw_affiliation_string":"Carnegie-Mellon University, Pittsburgh, Pa., USA#TAB#","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5000042413"],"corresponding_institution_ids":["https://openalex.org/I74973139"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":120,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"151","last_page":"158"},"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9993000030517578,"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"}},{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/logarithm","display_name":"Logarithm","score":0.790332555770874},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6618135571479797},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.6459733247756958},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6089324951171875},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5603790283203125},{"id":"https://openalex.org/keywords/log-log-plot","display_name":"Log-log plot","score":0.5038580298423767},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4659142792224884},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4386637806892395},{"id":"https://openalex.org/keywords/asymptotically-optimal-algorithm","display_name":"Asymptotically optimal algorithm","score":0.42457765340805054},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.18243077397346497},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.1375458538532257}],"concepts":[{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.790332555770874},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6618135571479797},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.6459733247756958},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6089324951171875},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5603790283203125},{"id":"https://openalex.org/C195292467","wikidata":"https://www.wikidata.org/wiki/Q2091879","display_name":"Log-log plot","level":3,"score":0.5038580298423767},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4659142792224884},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4386637806892395},{"id":"https://openalex.org/C181789720","wikidata":"https://www.wikidata.org/wiki/Q4812191","display_name":"Asymptotically optimal algorithm","level":2,"score":0.42457765340805054},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.18243077397346497},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.1375458538532257},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/1536414.1536437","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1536414.1536437","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-first annual ACM symposium on Theory of computing","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.150.3050","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.150.3050","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.cmu.edu/~eblais/papers/TestingJuntas.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W1502936039","https://openalex.org/W1554944419","https://openalex.org/W1598302191","https://openalex.org/W1970630090","https://openalex.org/W1975515425","https://openalex.org/W1992068214","https://openalex.org/W2018925011","https://openalex.org/W2040820014","https://openalex.org/W2055194501","https://openalex.org/W2057298561","https://openalex.org/W2074868939","https://openalex.org/W2087038607","https://openalex.org/W2095933180","https://openalex.org/W2111385661","https://openalex.org/W2133263321","https://openalex.org/W2154224414","https://openalex.org/W2162117620","https://openalex.org/W2202947145","https://openalex.org/W2396436214","https://openalex.org/W2914377170","https://openalex.org/W3142201492"],"related_works":["https://openalex.org/W2035522910","https://openalex.org/W2005615533","https://openalex.org/W4243665620","https://openalex.org/W1529311266","https://openalex.org/W2047234016","https://openalex.org/W2052169362","https://openalex.org/W1608733163","https://openalex.org/W1983915440","https://openalex.org/W3095925971","https://openalex.org/W2005304136"],"abstract_inverted_index":{"A":[0],"function":[1,32],"on":[2,12,60],"n":[3],"variables":[4],"is":[5,26,33,37,53,71],"called":[6],"a":[7,31,34,41,76],"k-junta":[8,35,42],"if":[9],"it":[10,25],"depends":[11],"at":[13],"most":[14],"k":[15,46,48],"of":[16,66],"its":[17],"variables.":[18],"In":[19],"this":[20],"article,":[21],"we":[22],"show":[23],"that":[24],"possible":[27],"to":[28,75],"test":[29],"whether":[30],"or":[36],"\"far\"":[38],"from":[39],"being":[40],"with":[43],"O(k\u03b5":[44],"+":[45],"log":[47],")":[49],"queries,":[50],"where":[51],"epsilon":[52],"the":[54,61],"approximation":[55],"parameter.":[56],"This":[57],"result":[58],"improves":[59],"previous":[62],"best":[63],"upper":[64],"bound":[65],"O":[67],"(k3/2)\u03b5":[68],"queries":[69],"and":[70],"asymptotically":[72],"optimal,":[73],"up":[74],"logarithmic":[77],"factor.":[78]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":11},{"year":2018,"cited_by_count":10},{"year":2017,"cited_by_count":7},{"year":2016,"cited_by_count":9},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":13},{"year":2012,"cited_by_count":14}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}
