{"paper":{"title":"A Note on Polynomial Identity Testing for Depth-3 Circuits","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Abhranil Chatterjee, Partha Mukhopadhyay, Rajit Datta, V. Arvind","submitted_at":"2018-05-17T10:48:11Z","abstract_excerpt":"Let $C$ be a depth-3 arithmetic circuit of size at most $s$, computing a polynomial $ f \\in \\mathbb{F}[x_1,\\ldots, x_n] $ (where $\\mathbb{F}$ = $\\mathbb{Q}$ or $\\mathbb{C}$) and the fan-in of the product gates of $C$ is bounded by $d$. We give a deterministic polynomial identity testing algorithm to check whether $f\\equiv 0$ or not in time $ 2^d \\text{ poly}(n,s) $."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.06692","kind":"arxiv","version":2},"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"}