Algebraic dependencies and PSPACE algorithms in approximative complexity over any field
From MaRDI portal
Publication:5215662
Recommendations
- scientific article; zbMATH DE number 7250150
- A PSPACE construction of a hitting set for the closure of small algebraic circuits
- A deterministic PTAS for the algebraic rank of bounded degree polynomials
- Algebraic independence and blackbox identity testing
- Algebraic independence over positive characteristic: new criterion and applications to locally low algebraic rank circuits
Cited in
(9)- Algebraic independence over positive characteristic: new criterion and applications to locally low-algebraic-rank circuits
- Blackbox identity testing for sum of special ROABPs and its border class
- A note on VNP-completeness and border complexity
- scientific article; zbMATH DE number 7250150 (Why is no real title available?)
- A deterministic PTAS for the algebraic rank of bounded degree polynomials
- Weighted sum-of-squares lower bounds for univariate polynomials imply \(\mathsf{VP} \neq \mathsf{VNP}\)
- Variety evasive subspace families
- Constructing faithful homomorphisms over fields of finite characteristic
- Real -conjecture for sum-of-squares: a unified approach to lower bound and derandomization
This page was built for publication: Algebraic dependencies and \(\mathsf{PSPACE}\) algorithms in approximative complexity over any field
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5215662)
