No occurrence obstructions in geometric complexity theory (Q4961749): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Created claim: Wikidata QID (P12): Q129332102, #quickstatements; #temporary_batch_1724808069555
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2889385527 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1604.06431 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colorings and orientations of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound for the determinantal complexity of a hypersurface / 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: Cook's versus Valiant's hypothesis / 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: Even partitions in plethysms. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonvanishing of Kronecker coefficients for rectangular shapes. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Permanent versus determinant: Not via saturations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamental invariants of orbit closures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2959048 / 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: Quadratic lower bound for permanent vs. determinant in any characteristic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Plethysm and vertex operators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3182283 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4780265 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4002278 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric complexity theory and matrix powering / rank
 
Normal rank
Property / cites work
 
Property / cites work: \((\mathrm{GL}_n,\mathrm{GL}_m)\)-duality and symmetric plethysm / rank
 
Normal rank
Property / cites work
 
Property / cites work: The boundary of the orbit of the 3-by-3 determinant polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: Binary determinantal complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On vanishing of Kronecker coefficients / 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: Padded Polynomials, Their Cousins, and Geometric Complexity Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: A study of the representations supported by the orbit closure of the determinant / 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: On the ranks and border ranks of symmetric tensors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determining representations from invariant dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4399987 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing Valiant's algebraic complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4260722 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4661386 / 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 I: An Approach to the<i>P</i>vs.<i>NP</i>and Related Problems / 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: Q3600653 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4501788 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of computing the permanent / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3929052 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some observations of plethysms / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q129332102 / rank
 
Normal rank

Latest revision as of 03:34, 28 August 2024

scientific article; zbMATH DE number 6965352
Language Label Description Also known as
English
No occurrence obstructions in geometric complexity theory
scientific article; zbMATH DE number 6965352

    Statements

    No occurrence obstructions in geometric complexity theory (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    25 October 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    permanent versus determinant
    0 references
    geometric complexity theory
    0 references
    orbit closures
    0 references
    representations
    0 references
    plethysms
    0 references
    Young tableaux
    0 references
    tensors
    0 references
    highest weight vectors
    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