Geometric complexity theory V: Efficient algorithms for Noether normalization (Q2826783)

scientific article

Language	Label	Description	Also known as
English	Geometric complexity theory V: Efficient algorithms for Noether normalization	scientific article

Statements

instance of

scholarly article

0 references

title

Geometric complexity theory V: Efficient algorithms for Noether normalization (English)

0 references

published in

Journal of the American Mathematical Society

0 references

publication date

18 October 2016

0 references

full work available at URL

https://arxiv.org/abs/1209.5993

0 references

zbMATH Keywords

geometric complexity theory

0 references

Noether normalization

0 references

explicit varieties

0 references

author

Ketan D. Mulmuley

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science

0 references

Quasi-polynomial hitting-set for set-depth-Δ formulas

0 references

Computational Complexity

0 references

Arithmetic Circuits and the Hadamard Product of Polynomials

0 references

New results on quantifier elimination over real closed fields and applications to constraint databases

0 references

Geometric Complexity Theory IV: nonstandard quantum group for the Kronecker problem

0 references

Singularités rationnelles et quotients par les groupes réductifs. (Rational singularities and quotients by reductive groups)

0 references

Q5768448

0 references

Q5168198

0 references

Q4274969

0 references

Semisimple Representations of Quivers

0 references

Completeness and reduction in algebraic complexity theory

0 references

The complexity of factors of multivariate polynomials

0 references

An Overview of Mathematical Issues Arising in the Geometric Complexity Theory Approach to $\mathbf{VP}\neq\mathbf{VNP}$

0 references

A taxonomy of problems with fast parallel algorithms

0 references

Polynomial bounds for rings of invariants

0 references

Computational invariant theory. With two appendices by Vladimir L. Popov and an addendum by Nobert A. Campo and Vladimir L. Popov

0 references

Polynomial degree bounds for matrix semi-invariants

0 references

Semi-invariants of quivers and saturation for Littlewood-Richardson coefficients

0 references

The Historical Development of Algebraic Geometry

0 references

Q4793094

0 references

Semi-invariants of quivers as determinants

0 references

Invariants of several matrices

0 references

On the Foundations of Combinatorial Theory: IX Combinatorial Methods in Invariant Theory

0 references

Tame and wild matrix problems

0 references

Q4317713

0 references

Rationale quasihomogene Singularitäten

0 references

Hitting sets for multilinear read-once algebraic branching programs, in any order

0 references

Explicit Noether Normalization for Simultaneous Conjugation via Polynomial Identity Testing

0 references

Q3737600

0 references

Q4002278

0 references

Computing bases for rings of permutation-invariant polynomials

0 references

The Multivariate Resultant Is NP-hard in Any Characteristic

0 references

Unifying known lower bounds via geometric complexity theory

0 references

Boundaries of VP and VNP

0 references

Q4143433

0 references

Q4089001

0 references

Probabilistic Algorithms for Deciding Equivalence of Straight-Line Programs

0 references

Rectangular Kronecker coefficients and plethysms in geometric complexity theory

0 references

Q4526985

0 references

Derandomizing polynomial identity tests means proving circuit lower bounds

0 references

Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators

0 references

A Selection of Lower Bounds for Arithmetic Circuits

0 references

MODULI OF REPRESENTATIONS OF FINITE DIMENSIONAL ALGEBRAS

0 references

Hilbert's Nullstellensatz is in the polynomial hierarchy

0 references

Sharp Effective Nullstellensatz

0 references

Standard monomial theory. Invariant theoretic approach

0 references

Q3096060

0 references

Hypersurfaces with degenerate duals and the geometric complexity theory program

0 references

Characterizing Valiant's algebraic complexity classes

0 references

Space-efficient Gröbner basis computation without degree bounds

0 references

Multivariate polynomials, duality, and structured matrices

0 references

Lower Bounds in a Parallel Model without Bit Operations

0 references

On P vs. NP and geometric complexity theory

0 references

Geometric complexity theory. III: On deciding nonvanishing of a Littlewood-Richardson coefficient

0 references

Geometric Complexity Theory I: An Approach to the<i>P</i>vs.<i>NP</i>and Related Problems

0 references

Q4432491

0 references

Geometric Complexity Theory II: Towards Explicit Obstructions for Embeddings among Class Varieties

0 references

Algebraic Geometry. I: Complex projective varieties.

0 references

Geometric Invariant Theory

0 references

Hardness vs randomness

0 references

An upper bound for the length of a finite-dimensional algebra

0 references

Q3934509

0 references

The invariant theory of $n\times n$ matrices

0 references

Deterministic polynomial identity testing in non-commutative models

0 references

TRACE IDENTITIES OF FULL MATRIX ALGEBRAS OVER A FIELD OF CHARACTERISTIC ZERO

0 references

Diagonal Circuit Identity Testing and Lower Bounds

0 references

Fast Probabilistic Algorithms for Verification of Polynomial Identities

0 references

Q4135685

0 references

Improved Polynomial Identity Testing for Read-Once Formulas

0 references

Arithmetic Circuits: A survey of recent results and open questions

0 references

Die Berechnungskomplexität von elementarsymmetrischen Funktionen und von Interpolationskoeffizienten

0 references

Algorithms in invariant theory

0 references

The complexity of computing the permanent

0 references

Fast Parallel Computation of Polynomials Using Few Processors

0 references

Q4413049

0 references

Identifiers

zbMATH Open document ID

1402.14078

0 references

DOI

10.1090/jams/864

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2826783