{"id":"https://openalex.org/W2518363412","doi":"https://doi.org/10.1017/s0963548312000363","title":"Testing Odd-Cycle-Freeness in Boolean Functions","display_name":"Testing Odd-Cycle-Freeness in Boolean Functions","publication_year":2012,"publication_date":"2012-01-17","ids":{"openalex":"https://openalex.org/W2518363412","doi":"https://doi.org/10.1017/s0963548312000363","mag":"2518363412"},"language":"en","primary_location":{"id":"doi:10.1017/s0963548312000363","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0963548312000363","pdf_url":null,"source":{"id":"https://openalex.org/S7291079","display_name":"Combinatorics Probability Computing","issn_l":"0963-5483","issn":["0963-5483","1469-2163"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorics, Probability and Computing","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1105.1325","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5102919901","display_name":"Arnab Bhattacharyya","orcid":"https://orcid.org/0000-0002-3648-5957"},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]},{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Arnab Bhattacharyya","raw_affiliation_strings":["Center for Computational Intractability, Princeton, NJGeorgia Tech, Atlanta, GAGeorgia Tech, Atlanta, GAGeorgia Tech, Atlanta, GA","Center for computational intractability, olden street, princeton, nj 08540, usa (e-mail: arnabb@princeton.edu)#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Center for Computational Intractability, Princeton, NJGeorgia Tech, Atlanta, GAGeorgia Tech, Atlanta, GAGeorgia Tech, Atlanta, GA","institution_ids":["https://openalex.org/I130701444"]},{"raw_affiliation_string":"Center for computational intractability, olden street, princeton, nj 08540, usa (e-mail: arnabb@princeton.edu)#TAB#","institution_ids":["https://openalex.org/I20089843"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5090091569","display_name":"Elena Grigorescu","orcid":"https://orcid.org/0000-0001-9673-4313"},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Elena Grigorescu","raw_affiliation_strings":["Center for Computational Intractability, Princeton, NJGeorgia Tech, Atlanta, GAGeorgia Tech, Atlanta, GAGeorgia Tech, Atlanta, GA","College of computing, georgia tech, 801 atlantic drive, atlanta, ga 30332, usa (e-mail: elena_g@csail.mit.edu, raghavendra@cc.gatech.edu, asafico@math.gatech.edu#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Center for Computational Intractability, Princeton, NJGeorgia Tech, Atlanta, GAGeorgia Tech, Atlanta, GAGeorgia Tech, Atlanta, GA","institution_ids":["https://openalex.org/I130701444"]},{"raw_affiliation_string":"College of computing, georgia tech, 801 atlantic drive, atlanta, ga 30332, usa (e-mail: elena_g@csail.mit.edu, raghavendra@cc.gatech.edu, asafico@math.gatech.edu#TAB#","institution_ids":["https://openalex.org/I130701444"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101701586","display_name":"Prasad Raghavendra","orcid":"https://orcid.org/0009-0009-7851-0653"},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Prasad Raghavendra","raw_affiliation_strings":["Center for Computational Intractability, Princeton, NJGeorgia Tech, Atlanta, GAGeorgia Tech, Atlanta, GAGeorgia Tech, Atlanta, GA","College of computing, georgia tech, 801 atlantic drive, atlanta, ga 30332, usa (e-mail: elena_g@csail.mit.edu, raghavendra@cc.gatech.edu, asafico@math.gatech.edu#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Center for Computational Intractability, Princeton, NJGeorgia Tech, Atlanta, GAGeorgia Tech, Atlanta, GAGeorgia Tech, Atlanta, GA","institution_ids":["https://openalex.org/I130701444"]},{"raw_affiliation_string":"College of computing, georgia tech, 801 atlantic drive, atlanta, ga 30332, usa (e-mail: elena_g@csail.mit.edu, raghavendra@cc.gatech.edu, asafico@math.gatech.edu#TAB#","institution_ids":["https://openalex.org/I130701444"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5089978763","display_name":"A. Shapira","orcid":"https://orcid.org/0000-0001-9902-0164"},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Asaf Shapira","raw_affiliation_strings":["Center for Computational Intractability, Princeton, NJGeorgia Tech, Atlanta, GAGeorgia Tech, Atlanta, GAGeorgia Tech, Atlanta, GA","College of computing, georgia tech, 801 atlantic drive, atlanta, ga 30332, usa (e-mail: elena_g@csail.mit.edu, raghavendra@cc.gatech.edu, asafico@math.gatech.edu and school of mathematical science ...#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Center for Computational Intractability, Princeton, NJGeorgia Tech, Atlanta, GAGeorgia Tech, Atlanta, GAGeorgia Tech, Atlanta, GA","institution_ids":["https://openalex.org/I130701444"]},{"raw_affiliation_string":"College of computing, georgia tech, 801 atlantic drive, atlanta, ga 30332, usa (e-mail: elena_g@csail.mit.edu, raghavendra@cc.gatech.edu, asafico@math.gatech.edu and school of mathematical science ...#TAB#","institution_ids":["https://openalex.org/I130701444"]}]}],"institutions":[],"countries_distinct_count":1,"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.28498673,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"21","issue":"6","first_page":"1140","last_page":"1149"},"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.9994999766349792,"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.9994999766349792,"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.9905999898910522,"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/T10237","display_name":"Cryptography and Data Security","score":0.9882000088691711,"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/mathematics","display_name":"Mathematics","score":0.7135061025619507},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.6719546914100647},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5895991325378418},{"id":"https://openalex.org/keywords/parity-function","display_name":"Parity function","score":0.5630121827125549},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.4950653612613678},{"id":"https://openalex.org/keywords/invariant","display_name":"Invariant (physics)","score":0.49157723784446716},{"id":"https://openalex.org/keywords/complete-boolean-algebra","display_name":"Complete Boolean algebra","score":0.49153146147727966},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4727374315261841},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.46511557698249817},{"id":"https://openalex.org/keywords/property-testing","display_name":"Property testing","score":0.41816383600234985},{"id":"https://openalex.org/keywords/two-element-boolean-algebra","display_name":"Two-element Boolean algebra","score":0.3512330651283264},{"id":"https://openalex.org/keywords/boolean-expression","display_name":"Boolean expression","score":0.32666927576065063},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.22049763798713684},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.1588086485862732},{"id":"https://openalex.org/keywords/algebra-representation","display_name":"Algebra representation","score":0.07832792401313782}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7135061025619507},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.6719546914100647},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5895991325378418},{"id":"https://openalex.org/C188183281","wikidata":"https://www.wikidata.org/wiki/Q2898309","display_name":"Parity function","level":4,"score":0.5630121827125549},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.4950653612613678},{"id":"https://openalex.org/C190470478","wikidata":"https://www.wikidata.org/wiki/Q2370229","display_name":"Invariant (physics)","level":2,"score":0.49157723784446716},{"id":"https://openalex.org/C81518389","wikidata":"https://www.wikidata.org/wiki/Q5156447","display_name":"Complete Boolean algebra","level":5,"score":0.49153146147727966},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4727374315261841},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.46511557698249817},{"id":"https://openalex.org/C123842658","wikidata":"https://www.wikidata.org/wiki/Q2918980","display_name":"Property testing","level":2,"score":0.41816383600234985},{"id":"https://openalex.org/C207764348","wikidata":"https://www.wikidata.org/wiki/Q7858706","display_name":"Two-element Boolean algebra","level":4,"score":0.3512330651283264},{"id":"https://openalex.org/C158465420","wikidata":"https://www.wikidata.org/wiki/Q1979515","display_name":"Boolean expression","level":3,"score":0.32666927576065063},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.22049763798713684},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.1588086485862732},{"id":"https://openalex.org/C14394260","wikidata":"https://www.wikidata.org/wiki/Q4723980","display_name":"Algebra representation","level":3,"score":0.07832792401313782},{"id":"https://openalex.org/C37914503","wikidata":"https://www.wikidata.org/wiki/Q156495","display_name":"Mathematical physics","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":10,"locations":[{"id":"doi:10.1017/s0963548312000363","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0963548312000363","pdf_url":null,"source":{"id":"https://openalex.org/S7291079","display_name":"Combinatorics Probability Computing","issn_l":"0963-5483","issn":["0963-5483","1469-2163"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorics, Probability and Computing","raw_type":"journal-article"},{"id":"doi:10.1137/1.9781611973099.90","is_oa":false,"landing_page_url":"https://doi.org/10.1137/1.9781611973099.90","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:1105.1325","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1105.1325","pdf_url":"https://arxiv.org/pdf/1105.1325","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.220.9165","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.220.9165","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.math.tau.ac.il/%7Easafico/ocf.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.231.3074","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.231.3074","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://siam.omnibooksonline.com/2012SODA/data/papers/277.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.298.2341","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.298.2341","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.math.tau.ac.il/~asafico/ocf.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.739.1012","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.739.1012","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.berkeley.edu/%7Eprasad/Files/ocf.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.767.6","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.767.6","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/1105.1325.pdf","raw_type":"text"},{"id":"doi:10.48550/arxiv.1105.1325","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1105.1325","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"},{"id":"mag:2949759601","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":null}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1105.1325","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1105.1325","pdf_url":"https://arxiv.org/pdf/1105.1325","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1739214","display_name":"AF: Medium: Taming Masssive Data with Sub-Linear Algorithms","funder_award_id":"1065125","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G2841406118","display_name":"The Second CI Fellows Project","funder_award_id":"1019343","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3292170999","display_name":null,"funder_award_id":"DMS-0901355","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5087765963","display_name":"Fast Approximate Algorithms for Wireless Sensor Networks","funder_award_id":"0728645","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2518363412.pdf","grobid_xml":"https://content.openalex.org/works/W2518363412.grobid-xml"},"referenced_works_count":27,"referenced_works":["https://openalex.org/W345958763","https://openalex.org/W1617050449","https://openalex.org/W1970630090","https://openalex.org/W1973652906","https://openalex.org/W1985538939","https://openalex.org/W1995043396","https://openalex.org/W1999617330","https://openalex.org/W2000079459","https://openalex.org/W2018925011","https://openalex.org/W2019475553","https://openalex.org/W2037773642","https://openalex.org/W2073966617","https://openalex.org/W2083580384","https://openalex.org/W2083766801","https://openalex.org/W2101060997","https://openalex.org/W2128717558","https://openalex.org/W2129465918","https://openalex.org/W2139374679","https://openalex.org/W2146453677","https://openalex.org/W2161620758","https://openalex.org/W2808268686","https://openalex.org/W2964194804","https://openalex.org/W3004537778","https://openalex.org/W3008660429","https://openalex.org/W3083751883","https://openalex.org/W4214852299","https://openalex.org/W4251160190"],"related_works":["https://openalex.org/W2543172121","https://openalex.org/W2964073278","https://openalex.org/W2129465918","https://openalex.org/W2279094782","https://openalex.org/W2952477503","https://openalex.org/W2060706760","https://openalex.org/W2091126969","https://openalex.org/W165250290","https://openalex.org/W115672173","https://openalex.org/W2952147886","https://openalex.org/W2404312679","https://openalex.org/W1532982261","https://openalex.org/W59442591","https://openalex.org/W2963901129","https://openalex.org/W2952783120","https://openalex.org/W2949566844","https://openalex.org/W2749098850","https://openalex.org/W3035477538","https://openalex.org/W3099325101","https://openalex.org/W1559446374"],"abstract_inverted_index":{"A":[0,216],"function":[1,238],"is":[2,82,202,205,250,257,264],"odd-cycle-free":[3,36,43],"if":[4,232],"there":[5,204,256,263],"are":[6],"no":[7],"with":[8],"k":[9],"an":[10,49,143,191,206],"odd":[11],"integer":[12],"such":[13,163],"that":[14,32],"f(x1)":[15],"=":[16,18,20,28],"\u2026":[17,25],"f(xk)":[19],"1":[21],"and":[22,73,229],"x1":[23],"+":[24,26],"xk":[27],"0.":[29],"We":[30,52,96,274],"show":[31,97,162],"one":[33,160],"can":[34],"distinguish":[35],"functions":[37,72,90],"from":[38,41,101,269],"those":[39],"\u220a-far":[40],"being":[42],"by":[44,128,195,223],"making":[45],"poly(1/\u220a)":[46],"queries":[47],"to":[48,91,104,131,151,175,182,239],"evaluation":[50],"oracle.":[51],"give":[53],"two":[54],"proofs":[55],"of":[56,68,70,74,88,107,135,146,185,213,235],"this":[57],"result,":[58],"each":[59],"shedding":[60],"light":[61],"on":[62],"a":[63,98,132,149,164,183,225,243,258,266],"different":[64],"connection":[65],"between":[66],"testability":[67],"properties":[69,87,126,212,221],"Boolean":[71,89,214],"dense":[75],"graphs.":[76,108],"The":[77,197,248,281],"first":[78],"problem":[79,193],"we":[80,200],"study":[81,201],"directly":[83],"reducing":[84],"testing":[85,92,102,105,154],"linear-invariant":[86,125,170,189,211,220,254],"associated":[93],"graph":[94,152],"properties.":[95],"black-box":[99],"reduction":[100,150,165],"odd-cycle-freeness":[103,139],"bipartiteness":[106],"Such":[109],"reductions":[110],"have":[111],"been":[112],"shown":[113],"previously":[114,157],"(Kr\u00e1l-Serra-Vena,":[115],"Israel":[116],"J.":[117],"Math":[118],"2011;":[119],"Shapira,":[120],"STOC":[121],"2009)":[122],"for":[123,138,168,210,219,252,261,279],"monotone":[124],"defined":[127],"forbidding":[129],"solutions":[130],"finite":[133],"number":[134,145],"equations.":[136],"But":[137],"whose":[140],"description":[141],"involves":[142],"infinite":[144],"forbidden":[147],"equations,":[148],"property":[153,171,245],"was":[155],"not":[156],"known.":[158],"If":[159],"could":[161],"more":[166],"generally":[167],"any":[169],"closed":[172],"under":[173],"restrictions":[174],"subspaces,":[176],"then":[177,230],"it":[178],"would":[179],"likely":[180],"lead":[181],"characterization":[184],"the":[186,233,236,240,270,276],"one-sided":[187],"testable":[188],"properties,":[190],"open":[192],"raised":[194],"Sudan.":[196],"second":[198],"issue":[199],"whether":[203,251],"efficient":[207],"canonical":[208,217,259],"tester":[209,218,260],"functions.":[215],"operates":[222],"picking":[224],"random":[226],"linear":[227],"subspace":[228,241],"checking":[231],"restriction":[234],"input":[237],"satisfies":[242],"fixed":[244],"or":[246],"not.":[247],"question":[249,277,283],"every":[253],"property,":[255],"which":[262],"only":[265],"polynomial":[267],"blowup":[268],"optimal":[271],"query":[272],"complexity.":[273],"answer":[275],"affirmatively":[278],"odd-cycle-freeness.":[280],"general":[282],"still":[284],"remains":[285],"open.":[286]},"counts_by_year":[],"updated_date":"2026-07-15T18:14:33.161393","created_date":"2025-10-10T00:00:00"}