Geometric complexity theory V: Efficient algorithms for Noether normalization
From MaRDI portal
Publication:2826783
DOI10.1090/jams/864zbMath1402.14078arXiv1209.5993OpenAlexW2962732920MaRDI QIDQ2826783
Publication date: 18 October 2016
Published in: Journal of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1209.5993
Effectivity, complexity and computational aspects of algebraic geometry (14Q20) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items
Discovering the Roots: Uniform Closure Results for Algebraic Classes Under Factoring, Alternating minimization, scaling algorithms, and the null-cone problem from invariant theory, General linear group action on tensors: a candidate for post-quantum cryptography, Ranks of linear matrix pencils separate simultaneous similarity orbits, Unnamed Item, Sylvester-Gallai type theorems for quadratic polynomials, Generalized Littlewood-Richardson coefficients for branching rules of \(\mathrm{GL}(n)\) and extremal weight crystals, Algorithms for orbit closure separation for invariants and semi-invariants of matrices, Unnamed Item, Singular tuples of matrices is not a null cone (and the symmetries of algebraic varieties), Unnamed Item, A generalized sylvester-gallai type theorem for quadratic polynomials, Weyl's polarization theorem in positive characteristic, From Independent Sets and Vertex Colorings to Isotropic Spaces and Isotropic Decompositions: Another Bridge between Graphs and Alternating Matrix Spaces, Maximum Likelihood Estimation for Matrix Normal Models via Quiver Representations, Polystability in positive characteristic and degree lower bounds for invariant rings, Real \(\tau \)-conjecture for sum-of-squares: a unified approach to lower bound and derandomization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Geometric complexity theory. III: On deciding nonvanishing of a Littlewood-Richardson coefficient
- Computational invariant theory. With two appendices by Vladimir L. Popov and an addendum by Nobert A. Campo and Vladimir L. Popov
- Polynomial degree bounds for matrix semi-invariants
- The complexity of computing the permanent
- Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators
- Singularités rationnelles et quotients par les groupes réductifs. (Rational singularities and quotients by reductive groups)
- Rationale quasihomogene Singularitäten
- Invariants of several matrices
- The invariant theory of \(n\times n\) matrices
- Hardness vs randomness
- An upper bound for the length of a finite-dimensional algebra
- Completeness and reduction in algebraic complexity theory
- The complexity of factors of multivariate polynomials
- Deterministic polynomial identity testing in non-commutative models
- Algebraic Geometry. I: Complex projective varieties.
- Computing bases for rings of permutation-invariant polynomials
- Hypersurfaces with degenerate duals and the geometric complexity theory program
- Multivariate polynomials, duality, and structured matrices
- Unifying known lower bounds via geometric complexity theory
- Hilbert's Nullstellensatz is in the polynomial hierarchy
- Rectangular Kronecker coefficients and plethysms in geometric complexity theory
- Standard monomial theory. Invariant theoretic approach
- Characterizing Valiant's algebraic complexity classes
- Die Berechnungskomplexität von elementarsymmetrischen Funktionen und von Interpolationskoeffizienten
- Polynomial bounds for rings of invariants
- Geometric Complexity Theory I: An Approach to thePvs.NPand Related Problems
- A Selection of Lower Bounds for Arithmetic Circuits
- Explicit Noether Normalization for Simultaneous Conjugation via Polynomial Identity Testing
- Arithmetic Circuits and the Hadamard Product of Polynomials
- On P vs. NP and geometric complexity theory
- Semisimple Representations of Quivers
- Fast Parallel Computation of Polynomials Using Few Processors
- Arithmetic Circuits: A survey of recent results and open questions
- An Overview of Mathematical Issues Arising in the Geometric Complexity Theory Approach to $\mathbf{VP}\neq\mathbf{VNP}$
- New results on quantifier elimination over real closed fields and applications to constraint databases
- Diagonal Circuit Identity Testing and Lower Bounds
- The Multivariate Resultant Is NP-hard in Any Characteristic
- Geometric Complexity Theory II: Towards Explicit Obstructions for Embeddings among Class Varieties
- Improved Polynomial Identity Testing for Read-Once Formulas
- A taxonomy of problems with fast parallel algorithms
- Tame and wild matrix problems
- On the Foundations of Combinatorial Theory: IX Combinatorial Methods in Invariant Theory
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Probabilistic Algorithms for Deciding Equivalence of Straight-Line Programs
- TRACE IDENTITIES OF FULL MATRIX ALGEBRAS OVER A FIELD OF CHARACTERISTIC ZERO
- Lower Bounds in a Parallel Model without Bit Operations
- Geometric Invariant Theory
- MODULI OF REPRESENTATIONS OF FINITE DIMENSIONAL ALGEBRAS
- Boundaries of VP and VNP
- Sharp Effective Nullstellensatz
- Semi-invariants of quivers and saturation for Littlewood-Richardson coefficients
- Geometric Complexity Theory IV: nonstandard quantum group for the Kronecker problem
- Space-efficient Gröbner basis computation without degree bounds
- Hitting sets for multilinear read-once algebraic branching programs, in any order
- Computational Complexity
- Quasi-polynomial hitting-set for set-depth-Δ formulas
- The Historical Development of Algebraic Geometry
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
- Algorithms in invariant theory
- Derandomizing polynomial identity tests means proving circuit lower bounds
- Semi-invariants of quivers as determinants
