A Deterministic PTAS for the Algebraic Rank of Bounded Degree Polynomials

  title={A Deterministic PTAS for the Algebraic Rank of Bounded Degree Polynomials},
  author={Vishwas Bhargava and Markus Bl{\"a}ser and Gorav Jindal and Anurag Pandey},
We present a deterministic polynomial time approximation scheme (PTAS) for computing the algebraic rank of a set of bounded degree polynomials. The notion of algebraic rank naturally generalizes the notion of rank in linear algebra, i.e., instead of considering only the linear dependencies, we also consider higher degree algebraic dependencies among the input polynomials. More specifically, we give an algorithm that takes as input a set f := {f1, . . . , fn} ⊂ F[x1, . . . , xm] of polynomials… 
1 Citations
Basics of Invariant theory Invariant Theory and Computational Complexity 1
  • Computer Science
  • 2020
The aim of this exposition is to provide a bird’s eye view of the current literature and simultaneously equip the reader with necessary concepts required to delve into the area.


On the complexity of partial derivatives
The "trace method", recently used in combinatorics and in algebraic complexity to lower bound the rank of certain matrices, is analyzed and it is shown that this method provides a polynomial-time computable lower bound on the dimension of the span of partial derivatives, and from this method the authors derive closed-form lower bounds.
Constructive non-commutative rank computation is in deterministic polynomial time
The techniques developed in Ivanyos et al. (2017) are extended to obtain a deterministic polynomial-time algorithm for computing the non-commutative rank of linear spaces of matrices over any field to improve that lemma by removing a coprime condition there.
Randomness efficient identity testing of multivariate polynomials
This work obtains the first polynomial time algorithm for interpolating sparse polynomials over finite fields of large characteristic and yields a generalized isolation lemma which works with respect to a set of linear forms over a base set.
Extractors And Rank Extractors For Polynomial Sources
This paper constructs explicit deterministic extractors from polynomial sources, which are distributions sampled by low degree multivariate polynomials over finite fields, and uses a theorem of Bombieri to turn the condensers into extractors, which allows extracting all the randomness from poynomial sources over exponentially large prime fields.
A Deterministic Polynomial Time Algorithm for Non-commutative Rational Identity Testing
A deterministic polynomial time algorithm for testing if a symbolic matrix in non-commuting variables over Q is invertible or not, which efficiently solves several problems in different areas which had only exponential-time algorithms prior to this work.
Integer Factoring Using Small Algebraic Dependencies
The AKS primality test (2004) ideas for integer factoring are adapted, and the algorithm is polynomial time (on number theoretic conjectures) if the authors know a small algebraic dependence between p,q.
Operator Scaling: Theory and Applications
A complexity analysis of an existing algorithm due to Gurvits (J Comput Syst Sci 69(3):448–484, 2004 ), who proved it was polynomial time for certain classes of inputs, that is extended to actually approximate capacity to any accuracy in polynometric time.
A space of matrix of low rank is a vector space of rectangular matrices whose maximum rank is stricly smaller than the number of rows and the numbers of columns. Among these are the compression
Completeness classes in algebra
The aim of this paper is to demonstrate that for both algebraic and combinatorial problems this phenomenon exists in a form that is purely algebraic in both of the respects (A) and (B).
Hitting sets for multilinear read-once algebraic branching programs, in any order
Deterministic black-box polynomial identity testing algorithms for multilinear read-once oblivious algebraic branching programs (ROABPs), in nO(log2 n) time, which is the first sub-exponential time algorithm for this model.