Depth-4 Identity Testing and Noether’s Normalization Lemma
From MaRDI portal
Publication:5740194
DOI10.1007/978-3-319-34171-2_22zbMath1476.68085OpenAlexW2472420962MaRDI QIDQ5740194
Publication date: 25 July 2016
Published in: Computer Science – Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-34171-2_22
Analysis of algorithms and problem complexity (68Q25) Polynomials, factorization in commutative rings (13P05) Effectivity, complexity and computational aspects of algebraic geometry (14Q20) Randomized algorithms (68W20) Networks and circuits as models of computation; circuit complexity (68Q06)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Black box polynomial identity testing of generalized depth-3 arithmetic circuits with bounded top fan-in
- The ideal membership problem and polynomial identity testing
- Matching is as easy as matrix inversion
- PRIMES is in P
- Algebraic independence and blackbox identity testing
- Polynomial identity testing for depth 3 circuits
- Arithmetic Circuits: A Chasm at Depth 3
- Explicit Noether Normalization for Simultaneous Conjugation via Polynomial Identity Testing
- Arithmetic Circuits: A survey of recent results and open questions
- Proof verification and the hardness of approximation problems
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Combinatorial Nullstellensatz
- Blackbox Identity Testing for Bounded Top-Fanin Depth-3 Circuits: The Field Doesn't Matter
- Blackbox Polynomial Identity Testing for Depth 3 Circuits
- Randomness efficient identity testing of multivariate polynomials
- Deterministic Identity Testing of Depth-4 Multilinear Circuits with Bounded Top Fan-in
- Jacobian hits circuits
- Black-box identity testing of depth-4 multilinear circuits
- Locally Decodable Codes with Two Queries and Polynomial Identity Testing for Depth 3 Circuits
- Approaching the Chasm at Depth Four
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
- Derandomizing polynomial identity tests means proving circuit lower bounds
This page was built for publication: Depth-4 Identity Testing and Noether’s Normalization Lemma
