Algebraic Independence and Blackbox Identity Testing

DOI10.1007/978-3-642-22012-8_10zbMath1333.68134arXiv1102.2789OpenAlexW2172151718MaRDI QIDQ3012915

M. Beecken, Nitin Saxena, J. Mittmann

Publication date: 7 July 2011

Published in: Automata, Languages and Programming (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Polynomials over commutative rings (13B25) Randomized algorithms (68W20)

Related Items

Sylvester-Gallai type theorems for quadratic polynomials ⋮ Jacobian Hits Circuits: Hitting Sets, Lower Bounds for Depth-$D$ Occur-$k$ Formulas and Depth-3 Transcendence Degree-$k$ Circuits

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Extractors and rank extractors for polynomial sources
• Black box polynomial identity testing of generalized depth-3 arithmetic circuits with bounded top fan-in
• Deterministic polynomial identity tests for multilinear bounded-read formulae
• A probabilistic remark on algebraic program testing
• Algebraic independence and blackbox identity testing
• An Almost Optimal Rank Bound for Depth-3 Identities
• Arithmetic Circuits: A survey of recent results and open questions
• Primality and identity testing via Chinese remaindering
• A Course in Commutative Algebra
• A Lower Bound for the Formula Size of Rational Functions
• Fast Probabilistic Algorithms for Verification of Polynomial Identities
• Singular spaces of matrices and their application in combinatorics
• Reducing Randomness via Irrational Numbers
• Black-box identity testing of depth-4 multilinear circuits
• Blackbox identity testing for bounded top fanin depth-3 circuits
• 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: Algebraic Independence and Blackbox Identity Testing