Sums of Read-Once Formulas: How Many Summands Suffice?

DOI10.1007/978-3-319-34171-2_19zbMath1382.68341arXiv1603.02605OpenAlexW2296120333MaRDI QIDQ5740191

Meena Mahajan, Anuj Tawari

Publication date: 25 July 2016

Published in: Computer Science – Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1603.02605

Mathematics Subject Classification ID

Related Items (1)

Sums of read-once formulas: how many summands are necessary?

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
• Characterizing Arithmetic Read-Once Formulae
• Lower Bounds for Sums of Powers of Low Degree Univariates
• Interpolating Arithmetic Read-Once Formulas in Parallel
• Multi-linear formulas for permanent and determinant are of super-polynomial size
• Derandomizing polynomial identity tests means proving circuit lower bounds
• Unnamed Item

This page was built for publication: Sums of Read-Once Formulas: How Many Summands Suffice?