Publication:5002654
From MaRDI portal
DOI10.4230/LIPIcs.APPROX-RANDOM.2017.48zbMath1470.68043MaRDI QIDQ5002654
Publication date: 28 July 2021
68W20: Randomized algorithms
68Q06: Networks and circuits as models of computation; circuit complexity
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Read-once polynomial identity testing
- Combinatorial characterization of read-once formulae
- Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators
- Factoring sparse multivariate polynomials
- Negation can be exponentially powerful
- Factoring polynomials with rational coefficients
- On interpolating arithmetic read-once formulas with exponentiation
- Decoding of Reed Solomon codes beyond the error-correction bound
- Learning Boolean read-once formulas over generalized bases
- A case of depth-3 identity testing, sparse factorization and duality
- Algebraic independence and blackbox identity testing
- Deterministic distinct-degree factorization of polynomials over finite fields
- Characterizing Arithmetic Read-Once Formulae
- Arithmetic Circuits: A survey of recent results and open questions
- Polynomials whose powers are sparse
- Hardness-Randomness Tradeoffs for Bounded Depth Arithmetic Circuits
- On the Relation between Polynomial Identity Testing and Finding Variable Disjoint Factors
- Learning read-once formulas with queries
- Interpolating Arithmetic Read-Once Formulas in Parallel
- Improved decoding of Reed-Solomon and algebraic-geometry codes
- Randomness efficient identity testing of multivariate polynomials
- Ideals, Varieties, and Algorithms
- Deterministically Factoring Sparse Polynomials into Multilinear Factors and Sums of Univariate Polynomials
- Deterministic Identity Testing of Depth-4 Multilinear Circuits with Bounded Top Fan-in
- Jacobian hits circuits
- Reconstruction of depth-4 multilinear circuits with top fan-in 2
- Derandomizing polynomial identity tests means proving circuit lower bounds
- Pseudorandom generators without the XOR lemma
