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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Ketan D. Mulmuley / rank
Normal rank
 
Property / author
 
Property / author: Ketan D. Mulmuley / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2962732920 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1209.5993 / rank
 
Normal rank
Property / cites work
 
Property / cites work: FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-polynomial hitting-set for set-depth-Δ formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arithmetic Circuits and the Hadamard Product of Polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: New results on quantifier elimination over real closed fields and applications to constraint databases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric Complexity Theory IV: nonstandard quantum group for the Kronecker problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Singularités rationnelles et quotients par les groupes réductifs. (Rational singularities and quotients by reductive groups) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5768448 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5168198 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4274969 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semisimple Representations of Quivers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completeness and reduction in algebraic complexity theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of factors of multivariate polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Overview of Mathematical Issues Arising in the Geometric Complexity Theory Approach to $\mathbf{VP}\neq\mathbf{VNP}$ / rank
 
Normal rank
Property / cites work
 
Property / cites work: A taxonomy of problems with fast parallel algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial bounds for rings of invariants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational invariant theory. With two appendices by Vladimir L. Popov and an addendum by Nobert A. Campo and Vladimir L. Popov / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial degree bounds for matrix semi-invariants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-invariants of quivers and saturation for Littlewood-Richardson coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Historical Development of Algebraic Geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4793094 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-invariants of quivers as determinants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Invariants of several matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Foundations of Combinatorial Theory: IX Combinatorial Methods in Invariant Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tame and wild matrix problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4317713 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rationale quasihomogene Singularitäten / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hitting sets for multilinear read-once algebraic branching programs, in any order / rank
 
Normal rank
Property / cites work
 
Property / cites work: Explicit Noether Normalization for Simultaneous Conjugation via Polynomial Identity Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3737600 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4002278 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing bases for rings of permutation-invariant polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Multivariate Resultant Is NP-hard in Any Characteristic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unifying known lower bounds via geometric complexity theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boundaries of VP and VNP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4143433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4089001 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic Algorithms for Deciding Equivalence of Straight-Line Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rectangular Kronecker coefficients and plethysms in geometric complexity theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4526985 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Derandomizing polynomial identity tests means proving circuit lower bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Selection of Lower Bounds for Arithmetic Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: MODULI OF REPRESENTATIONS OF FINITE DIMENSIONAL ALGEBRAS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hilbert's Nullstellensatz is in the polynomial hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sharp Effective Nullstellensatz / rank
 
Normal rank
Property / cites work
 
Property / cites work: Standard monomial theory. Invariant theoretic approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3096060 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypersurfaces with degenerate duals and the geometric complexity theory program / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing Valiant's algebraic complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space-efficient Gröbner basis computation without degree bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multivariate polynomials, duality, and structured matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds in a Parallel Model without Bit Operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On P vs. NP and geometric complexity theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric complexity theory. III: On deciding nonvanishing of a Littlewood-Richardson coefficient / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric Complexity Theory I: An Approach to the<i>P</i>vs.<i>NP</i>and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4432491 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric Complexity Theory II: Towards Explicit Obstructions for Embeddings among Class Varieties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic Geometry. I: Complex projective varieties. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric Invariant Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness vs randomness / rank
 
Normal rank
Property / cites work
 
Property / cites work: An upper bound for the length of a finite-dimensional algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3934509 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The invariant theory of \(n\times n\) matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic polynomial identity testing in non-commutative models / rank
 
Normal rank
Property / cites work
 
Property / cites work: TRACE IDENTITIES OF FULL MATRIX ALGEBRAS OVER A FIELD OF CHARACTERISTIC ZERO / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diagonal Circuit Identity Testing and Lower Bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Probabilistic Algorithms for Verification of Polynomial Identities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4135685 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Polynomial Identity Testing for Read-Once Formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arithmetic Circuits: A survey of recent results and open questions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Die Berechnungskomplexität von elementarsymmetrischen Funktionen und von Interpolationskoeffizienten / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms in invariant theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of computing the permanent / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Parallel Computation of Polynomials Using Few Processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4413049 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:50, 12 July 2024

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

    Statements

    Geometric complexity theory V: Efficient algorithms for Noether normalization (English)
    0 references
    0 references
    18 October 2016
    0 references
    0 references
    geometric complexity theory
    0 references
    Noether normalization
    0 references
    explicit varieties
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references