Characterizing Arithmetic Read-Once Formulae
From MaRDI portal
Publication:2828215
DOI10.1145/2858783zbMath1347.68148arXiv1408.1995OpenAlexW1544226152MaRDI QIDQ2828215
Publication date: 24 October 2016
Published in: ACM Transactions on Computation Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1408.1995
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (9)
Integer complexity: representing numbers of bounded defect ⋮ Sums of read-once formulas: how many summands are necessary? ⋮ Unnamed Item ⋮ On read-once functions over \(\mathbb{Z}_3\) ⋮ Sums of Read-Once Formulas: How Many Summands Suffice? ⋮ Building above read-once polynomials: identity testing and hardness of representation ⋮ Integer complexity: algorithms and computational results ⋮ Integer complexity: the integer defect ⋮ Limitations of sums of bounded read formulas and ABPs
Cites Work
- Read-once polynomial identity testing
- Combinatorial characterization of read-once formulae
- 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
- Improved low-degree testing and its applications
- Arithmetic Circuits: A survey of recent results and open questions
- On the Relation between Polynomial Identity Testing and Finding Variable Disjoint Factors
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Learning read-once formulas with queries
- Combinatorial Nullstellensatz
- Interpolating Arithmetic Read-Once Formulas in Parallel
- Learning Arithmetic Read-Once Formulas
- Randomness efficient identity testing of multivariate polynomials
- Unnamed Item
- Unnamed Item
This page was built for publication: Characterizing Arithmetic Read-Once Formulae
