{"id":"https://openalex.org/W154160818","doi":null,"title":"Tight lower bounds for adaptive linearity tests","display_name":"Tight lower bounds for adaptive linearity tests","publication_year":2007,"publication_date":"2007-01-01","ids":{"openalex":"https://openalex.org/W154160818","mag":"154160818"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.164.4201","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.164.4201","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://drops.dagstuhl.de/opus/volltexte/2008/1313/pdf/22011.LovettShachar.Paper.1313.pdf","raw_type":"text"},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"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/A5044999305","display_name":"Shachar Lovett","orcid":"https://orcid.org/0000-0003-4552-1443","observed_orcids":["https://orcid.org/0000-0003-4552-1443"]},"institutions":[{"id":"https://openalex.org/I53964585","display_name":"Weizmann Institute of Science","ror":"https://ror.org/0316ej306","country_code":"IL","type":"education","lineage":["https://openalex.org/I53964585"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Shachar Lovett","raw_affiliation_strings":["Weizmann Institute of Science"],"raw_orcid":"https://orcid.org/0000-0003-4552-1443","affiliations":[{"raw_affiliation_string":"Weizmann Institute of Science","institution_ids":["https://openalex.org/I53964585"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5044999305"],"corresponding_institution_ids":["https://openalex.org/I53964585"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"14","issue":null,"first_page":null,"last_page":null},"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.8295999765396118,"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.8295999765396118,"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.07890000194311142,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"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/T11130","display_name":"Coding theory and cryptography","score":0.024900000542402267,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/linearity-test","display_name":"linearity testing","score":0.8569999933242798},{"id":"https://openalex.org/keywords/adaptive-algorithms","display_name":"adaptive algorithms","score":0.7979999780654907},{"id":"https://openalex.org/keywords/lower-bounds","display_name":"lower bounds","score":0.7770000100135803},{"id":"https://openalex.org/keywords/query-complexity","display_name":"query complexity","score":0.8230000138282776},{"id":"https://openalex.org/keywords/soundness","display_name":"soundness","score":0.9070000052452087},{"id":"https://openalex.org/keywords/query-complexity-lower-bounds","display_name":"query complexity lower bounds","score":0.4860000014305115},{"id":"https://openalex.org/keywords/gowers-norms","display_name":"Gowers norms","score":0.921999990940094},{"id":"https://openalex.org/keywords/quadratic-functions","display_name":"quadratic functions","score":0.7789999842643738},{"id":"https://openalex.org/keywords/pcp-theorem","display_name":"PCP theorem","score":0.7070000171661377}],"concepts":[{"id":"https://openalex.org/C77170095","wikidata":"https://www.wikidata.org/wiki/Q1753188","display_name":"Linearity","level":2,"score":0.9031823873519897},{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.6370861530303955},{"id":"https://openalex.org/C39920170","wikidata":"https://www.wikidata.org/wiki/Q693083","display_name":"Soundness","level":2,"score":0.5420066714286804},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5280029773712158},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5257071852684021},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5160439014434814},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.5008468627929688},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.48737984895706177},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4739285111427307},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.41370338201522827},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3524492383003235},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.32612431049346924},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C115903868","wikidata":"https://www.wikidata.org/wiki/Q80993","display_name":"Software engineering","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.164.4201","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.164.4201","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://drops.dagstuhl.de/opus/volltexte/2008/1313/pdf/22011.LovettShachar.Paper.1313.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.242.8738","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.242.8738","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/0802.2857v1.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.430.2271","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.430.2271","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://eccc.hpi-web.de/report/2007/090/download/","raw_type":"text"},{"id":"mag:154160818","doi":null,"is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/journals/eccc/eccc14.html#Lovett07a","pdf_url":null,"source":{"id":"https://openalex.org/S11189987","display_name":"Electronic colloquium on computational complexity","issn_l":"1433-8092","issn":["1433-8092"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"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":null,"is_accepted":false,"is_published":false,"raw_source_name":"Electronic colloquium on computational complexity","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W1975810219","https://openalex.org/W1997855358","https://openalex.org/W2019578639","https://openalex.org/W2091921997","https://openalex.org/W2148352980","https://openalex.org/W3004537778"],"related_works":["https://openalex.org/W7095809489","https://openalex.org/W7098435325","https://openalex.org/W2156474636","https://openalex.org/W7206731156","https://openalex.org/W7095908946","https://openalex.org/W2087964954","https://openalex.org/W970692799","https://openalex.org/W7021282156","https://openalex.org/W2165100639","https://openalex.org/W2205939518"],"abstract_inverted_index":{"Linearity":[0,32,95],"tests":[1,33,96,233,259],"are":[2,18,28],"randomized":[3],"algorithms":[4],"which":[5,27],"have":[6],"oracle":[7],"access":[8],"to":[9,20,101,117,186,192],"the":[10,49,67,76,89,103,110,127,142,163,170,174,199,219,229,241,255,272],"truth":[11],"table":[12],"of":[13,57,91,105,173,231,239,244,257],"some":[14],"function":[15],"f,":[16],"and":[17,25,40,44,84,122,131,182,215],"supposed":[19],"distinguish":[21],"between":[22],"linear":[23,71],"functions":[24,26,80],"far":[29,81],"from":[30,82],"linear.":[31],"were":[34,45,97],"first":[35],"introduced":[36],"by":[37,63,179],"Blum,":[38],"Luby":[39],"Rubenfeld":[41],"in":[42,48,99,125,147,222],"[BLR93],":[43],"later":[46],"used":[47,221],"PCP":[50,119],"theorem,":[51],"among":[52,151],"other":[53,152],"applications.":[54],"The":[55],"quality":[56],"a":[58,249],"linearity":[59,106,157,194,206,232,258,278],"test":[60,158],"is":[61,212],"described":[62],"its":[64,73,85],"correctness":[65],"c-":[66],"probability":[68,77],"it":[69,78,93],"accepts":[70,79],"functions,":[72,246],"soundness":[74,104],"s-":[75],"linear,":[83],"query":[86,111],"complexity":[87,112],"q-":[88],"number":[90],"queries":[92],"makes.":[94],"studied":[98],"order":[100],"decrease":[102],"tests,":[107],"while":[108],"keeping":[109],"small":[113],"(for":[114],"one":[115,220],"reason,":[116],"improve":[118],"constructions).":[120],"Samorodnitsky":[121],"Trevisan":[123],"constructed":[124],"[ST00]":[126],"Complete":[128,143,164],"Graph":[129,136,144,165],"Test,":[130],"prove":[132,198,270],"that":[133,154],"no":[134,155],"Hyper":[135],"Test":[137],"can":[138,159],"perform":[139,160],"better":[140,161],"than":[141,162,218],"Test.":[145,166],"Later":[146],"[ST06]":[148],"they":[149],"prove,":[150],"results,":[153],"non-adaptive":[156],"Their":[167],"proof":[168,210,265],"uses":[169],"algebraic":[171],"machinery":[172],"Gowers":[175,242],"Norm.":[176],"A":[177],"result":[178],"Ben-Sasson,":[180],"Harsha":[181],"Raskhodnikova":[183],"[BHR05]":[184],"allows":[185],"generalize":[187],"this":[188],"lower":[189,202,273],"bound":[190,203,274],"also":[191,197,225,267,275],"adaptive":[193,205,277],"tests.":[195,279],"We":[196,224],"same":[200],"optimal":[201],"for":[204,276],"test,":[207],"but":[208],"our":[209],"technique":[211,266],"arguably":[213],"simpler":[214],"more":[216,250],"direct":[217,251],"[ST06].":[223],"study,":[226],"like":[227],"[ST06],":[228],"behavior":[230,256],"on":[234,260],"quadratic":[235,262],"functions.":[236,263],"However,":[237],"instead":[238],"analyzing":[240],"Norm":[243],"certain":[245],"we":[247],"provide":[248],"combinatorial":[252],"proof,":[253],"studying":[254],"random":[261],"This":[264],"lets":[268],"us":[269],"directly":[271]},"counts_by_year":[],"updated_date":"2026-08-26T07:47:46.906454","created_date":"2016-06-24T00:00:00"}