{"paper":{"title":"Lower Bounds on Testing Functions of Low Fourier Degree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Pooya Hatami","submitted_at":"2012-02-16T00:23:15Z","abstract_excerpt":"We consider the problem of testing whether a Boolean function has Fourier degree $\\leq k$ or it is $\\epsilon$-far from any Boolean function with Fourier degree $\\leq k$. We improve the known lower bound of $\\Omega(k)$ \\cite{BBM11,CGM10}, to $\\Omega(k/\\sqrt{\\epsilon})$. The lower bound uses the recently discovered connections between property testing and communication complexity by Blais \\textit{et. al.} \\cite{BBM11}"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.3479","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}