Q5092471 (Q5092471): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the power of algebraic branching programs of width two / 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: Identity testing and lower bounds for read- k oblivious algebraic branching programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Algebraic Formulas Using a Constant Number of Registers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relations between exact and approximate bilinear algorithms. Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(0(n^{2.7799})\) complexity for \(n\times n\) approximate matrix multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Algebraic Branching Programs of Small Width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Correction to: ``The complexity of factors of multivariate polynomials'' / 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: Q5875648 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric aspects of iterated matrix multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric complexity theory and matrix powering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boundaries of VP and VNP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for polynomials with algebraic coefficients / 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: Reconstruction of Full Rank Algebraic Branching Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A quadratic lower bound for homogeneous algebraic branching programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric complexity theory: an introduction for geometers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing Valiant's algebraic complexity classes / 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: Tensor-Rank and Lower Bounds for Arithmetic Formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4128012 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomials with Rational Coefficients Which are Hard to Compute / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separating monotone VP and VNP / rank
 
Normal rank

Latest revision as of 16:48, 29 July 2024

scientific article; zbMATH DE number 7561749
Language Label Description Also known as
English
No label defined
scientific article; zbMATH DE number 7561749

    Statements

    0 references
    0 references
    0 references
    0 references
    0 references
    21 July 2022
    0 references
    algebraic branching programs
    0 references
    border complexity
    0 references
    tangent spaces
    0 references
    lower bounds
    0 references
    geometric complexity theory
    0 references
    flows
    0 references
    VQP
    0 references
    VNP
    0 references
    0 references
    0 references
    0 references

    Identifiers