Fetching the paper…
Reading the bibliography…
Testing whether a set $\mathbf{f}$ of polynomials has an algebraic dependence is a basic problem with several applications.
Algebra I (Die Grundlagen)
O. Perron · 1927
Earlier work this paper cites.
Representation of matroids
Aubrey W Ingleton · 1971
Earlier work this paper cites.
Fast parallel matrix inversion algorithms
Laszlo Csanky · 1975
Earlier work this paper cites.
Testing polynomials which are easy to compute
Joos Heintz and Claus-Peter Schnorr · 1980
Earlier work this paper cites.
Fast probabilistic algorithms for verification of polynomial identities
J.T. Schwartz · 1980
Earlier work this paper cites.
The complexity of the word problems for commutative semigroups and polynomial ideals
Ernst W Mayr and Albert R Meyer · 1982
Earlier work this paper cites.
Trading group theory for randomness
László Babai · 1985
Earlier work this paper cites.
Finding irreducible polynomials over finite fields
L. M. Adleman and H. W. Lenstra · 1986
Earlier work this paper cites.
Sharp effective Nullstellensatz
János Kollár · 1988
Earlier work this paper cites.
On the order of approximation in approximative triadic decompositions of tensors
Thomas Lehmkuhl and Thomas Lickteig · 1989
Earlier work this paper cites.
Algebraic Geometry: A First Course
Joe Harris · 1992
Earlier work this paper cites.
Apolarity and canonical forms for homogeneous polynomials
Richard Ehrenborg and Gian-Carlo Rota · 1993
Earlier work this paper cites.
On the affine Bezout inequality
Joachim Schmid · 1995
Earlier work this paper cites.
Hilbert’s Nullstellensatz is in the polynomial hierarchy
Pascal Koiran · 1996
Earlier work this paper cites.
The complexity of factors of multivariate polynomials
Peter Bürgisser · 2001
Cited alongside, same era.
Algebraic dependence of polynomials after o. perron and some applications
Arkadiusz Płoski · 2005
Cited alongside, same era.
Complexity of ring morphism problems
Neeraj Kayal and Nitin Saxena · 2006
Cited alongside, same era.
Extractors and rank extractors for polynomial sources
Z. Dvir, A. Gabizon, and A. Wigderson · 2007
Cited alongside, same era.
Elusive functions and lower bounds for arithmetic circuits
Ran Raz · 2008
Cited alongside, same era.
Computational Complexity – A Modern Approach
S. Arora and B. Barak · 2009
Cited alongside, same era.
Extractors for varieties
Algebraic complexity theory
Peter Bürgisser, Michael Clausen, and Amin Shokrollahi · 2013
Later among the works it cites.
Algebraic geometry
Robin Hartshorne · 2013
Later among the works it cites.
Progress on polynomial identity testing - II
Nitin Saxena · 2013
Later among the works it cites.
Powers of tensors and fast matrix multiplication
François Le Gall · 2014
Later among the works it cites.
Algebraic independence in positive characteristic: A p p -adic calculus
Johannes Mittmann, Nitin Saxena, and Peter Scheiblechner · 2014
Later among the works it cites.
Computational invariant theory
Harm Derksen and Gregor Kemper · 2015
Later among the works it cites.
Arithmetic circuits with locally low algebraic rank
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Zeev Dvir · 2009
Cited alongside, same era.
The Complexity of the Annihilating Polynomial
N. Kayal · 2009
Cited alongside, same era.
Progress on polynomial identity testing
Nitin Saxena · 2009
Cited alongside, same era.
Arithmetic circuits: A survey of recent results and open questions
Amir Shpilka and Amir Yehudayoff · 2010
Cited alongside, same era.
Algebraic Independence and Blackbox Identity Testing
M. Beecken, J. Mittmann, and N. Saxena · 2011
Cited alongside, same era.
Jacobian hits circuits: Hitting-sets, lower bounds for depth-D occur-k formulas & depth-3 transcendence degree-k circuits
M. Agrawal, C. Saha, R. Saptharishi, and N. Saxena · 2012
Cited alongside, same era.
Mrinal Kumar and Shubhangi Saraf · 2016
Later among the works it cites.
Algebraic independence over positive characteristic: New criterion and applications to locally low algebraic rank circuits
Anurag Pandey, Nitin Saxena, and Amit Sinhababu · 2016
Later among the works it cites.
Bootstrapping variables in algebraic circuits
Manindra Agrawal, Sumanta Ghosh, and Nitin Saxena · 2017
Later among the works it cites.
On algebraic branching programs of small width
Karl Bringmann, Christian Ikenmeyer, and Jeroen Zuiddam · 2017
Later among the works it cites.
A PSPACE construction of a hitting set for the closure of small algebraic circuits
Michael A Forbes and Amir Shpilka · 2017
Later among the works it cites.
Geometric complexity theory V: Efficient algorithms for Noether normalization
Ketan Mulmuley · 2017
Later among the works it cites.
The complexity of tensor rank
Marcus Schaefer and Daniel Štefankovič · 2017
Later among the works it cites.