Algebraic independence and blackbox identity testing
From MaRDI portal
Publication:1951567
DOI10.1016/j.ic.2012.10.004zbMath1281.68107OpenAlexW2147588253MaRDI QIDQ1951567
Nitin Saxena, J. Mittmann, M. Beecken
Publication date: 6 June 2013
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2012.10.004
transcendence degreealgebraic independencearithmetic circuitspolynomial identity testingblackbox algorithmsdepth-4 circuits
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (15)
Algebraic independence over positive characteristic: new criterion and applications to locally low-algebraic-rank circuits ⋮ A generalized Sylvester–Gallai-type theorem for quadratic polynomials ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Estimation under group actions: recovering orbits from invariants ⋮ Products with variables from low-dimensional affine spaces and shifted power identity testing in finite fields ⋮ Algebraic Independence and Blackbox Identity Testing ⋮ Algebraic independence in positive characteristic: A $p$-adic calculus ⋮ Depth-4 Identity Testing and Noether’s Normalization Lemma ⋮ Jacobian Hits Circuits: Hitting Sets, Lower Bounds for Depth-$D$ Occur-$k$ Formulas and Depth-3 Transcendence Degree-$k$ Circuits ⋮ Unnamed Item ⋮ A generalized sylvester-gallai type theorem for quadratic polynomials ⋮ Unnamed Item ⋮ Improved hitting set for orbit of ROABPs ⋮ Lorentz- and permutation-invariants of particles
This page was built for publication: Algebraic independence and blackbox identity testing
