Sums of read-once formulas: how many summands are necessary?
From MaRDI portal
Publication:1686070
DOI10.1016/j.tcs.2017.10.019zbMath1382.68342OpenAlexW2766274873MaRDI QIDQ1686070
Publication date: 20 December 2017
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2017.10.019
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (2)
Lower bounds for special cases of syntactic multilinear ABPs ⋮ Limitations of sums of bounded read formulas and ABPs
Cites Work
- Read-once polynomial identity testing
- Deterministic polynomial identity tests for multilinear bounded-read formulae
- On interpolating arithmetic read-once formulas with exponentiation
- Learning Boolean read-once formulas over generalized bases
- Balancing syntactically multilinear arithmetic circuits
- Characterizing Arithmetic Read-Once Formulae
- Arithmetic Circuits: A survey of recent results and open questions
- Lower Bounds for Sums of Powers of Low Degree Univariates
- Hardness-Randomness Tradeoffs for Bounded Depth Arithmetic Circuits
- Interpolating Arithmetic Read-Once Formulas in Parallel
- Sums of Read-Once Formulas: How Many Summands Suffice?
- Multi-linear formulas for permanent and determinant are of super-polynomial size
- Derandomizing polynomial identity tests means proving circuit lower bounds
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Sums of read-once formulas: how many summands are necessary?
