Unifying known lower bounds via geometric complexity theory (Q2351393): Difference between revisions

@@ Property / describes a project that uses @@
+Magma
@@ Property / describes a project that uses: Magma / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+GAP
@@ Property / describes a project that uses: GAP / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+MathOverflow
@@ Property / describes a project that uses: MathOverflow / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2055240703
@@ Property / OpenAlex ID: W2055240703 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q59412423
@@ Property / Wikidata QID: Q59412423 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.6333
@@ Property / arXiv ID: 1304.6333 / rank @@
+Normal rank
@@ Property / cites work @@
+FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
+Normal rank
@@ Property / cites work @@
+Q4267800
@@ Property / cites work: Q4267800 / rank @@
+Normal rank
@@ Property / cites work @@
+A Uniform Circuit Lower Bound for the Permanent
@@ Property / cites work: A Uniform Circuit Lower Bound for the Permanent / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms in real algebraic geometry
@@ Property / cites work: Algorithms in real algebraic geometry / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of partial derivatives
@@ Property / cites work: The complexity of partial derivatives / rank @@
+Normal rank
@@ Property / cites work @@
+Relations between exact and approximate bilinear algorithms. Applications
+Normal rank
@@ Property / cites work @@
+\(0(n^{2.7799})\) complexity for \(n\times n\) approximate matrix multiplication
+Normal rank
@@ Property / cites work @@
+An insertion algorithm for catabolizability
@@ Property / cites work: An insertion algorithm for catabolizability / rank @@
+Normal rank
@@ Property / cites work @@
+Geometric Complexity Theory IV: nonstandard quantum group for the Kronecker problem
+Normal rank
@@ Property / cites work @@
+How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
+Normal rank
@@ Property / cites work @@
+Q4210476
@@ Property / cites work: Q4210476 / rank @@
+Normal rank
@@ Property / cites work @@
+The Magma algebra system. I: The user language
@@ Property / cites work: The Magma algebra system. I: The user language / rank @@
+Normal rank
@@ Property / cites work @@
+Invariant Hilbert schemes
@@ Property / cites work: Invariant Hilbert schemes / rank @@
+Normal rank
@@ Property / cites work @@
+Q4258566
@@ Property / cites work: Q4258566 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of factors of multivariate polynomials
+Normal rank
@@ Property / cites work @@
+Nonvanishing of Kronecker coefficients for rectangular shapes.
+Normal rank
@@ Property / cites work @@
+Q4331740
@@ Property / cites work: Q4331740 / rank @@
+Normal rank
@@ Property / cites work @@
+Deciding Positivity of Littlewood--Richardson Coefficients
+Normal rank
@@ Property / cites work @@
+Geometric complexity theory and tensor rank
@@ Property / cites work: Geometric complexity theory and tensor rank / rank @@
+Normal rank
@@ Property / cites work @@
+Explicit lower bounds via geometric complexity theory
+Normal rank
@@ Property / cites work @@
+An Overview of Mathematical Issues Arising in the Geometric Complexity Theory Approach to $\mathbf{VP}\neq\mathbf{VNP}$
+Normal rank
@@ Property / cites work @@
+Limits on alternation trading proofs for time-space lower bounds
+Normal rank
@@ Property / cites work @@
+Complexity of some parametric integer and network programming problems
+Normal rank
@@ Property / cites work @@
+Sums of Like Powers of Multivariate Linear Forms
@@ Property / cites work: Sums of Like Powers of Multivariate Linear Forms / rank @@
+Normal rank
@@ Property / cites work @@
+A hierarchy for nondeterministic time complexity
@@ Property / cites work: A hierarchy for nondeterministic time complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Matrix multiplication via arithmetic progressions
@@ Property / cites work: Matrix multiplication via arithmetic progressions / rank @@
+Normal rank
@@ Property / cites work @@
+Algebraic geometry I: algebraic curves, algebraic manifolds and schemes. Transl. from the Russian by D. Coray and V. N. Shokurov
+Normal rank
@@ Property / cites work @@
+An improved time-space lower bound for tautologies
+Normal rank
@@ Property / cites work @@
+Q4503944
@@ Property / cites work: Q4503944 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4317713
@@ Property / cites work: Q4317713 / rank @@
+Normal rank
@@ Property / cites work @@
+Time-space tradeoffs for satisfiability
@@ Property / cites work: Time-space tradeoffs for satisfiability / rank @@
+Normal rank
@@ Property / cites work @@
+Time-space lower bounds for satisfiability
@@ Property / cites work: Time-space lower bounds for satisfiability / rank @@
+Normal rank
@@ Property / cites work @@
+Q4002278
@@ Property / cites work: Q4002278 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of linear circuits and geometry
@@ Property / cites work: Complexity of linear circuits and geometry / rank @@
+Normal rank
@@ Property / cites work @@
+Symmetry, Representations, and Invariants
@@ Property / cites work: Symmetry, Representations, and Invariants / rank @@
+Normal rank
@@ Property / cites work @@
+Q3867905
@@ Property / cites work: Q3867905 / rank @@
+Normal rank
@@ Property / cites work @@
+Lower bound for the approximative complexity
@@ Property / cites work: Lower bound for the approximative complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Exponential lower bounds for depth 3 arithmetic circuits in algebras of functions over finite fields.
+Normal rank
@@ Property / cites work @@
+Q4542578
@@ Property / cites work: Q4542578 / rank @@
+Normal rank
@@ Property / cites work @@
+Unifying known lower bounds via geometric complexity theory
+Normal rank
@@ Property / cites work @@
+Éléments de géométrie algébrique. IV: Étude locale des schémas et des morphismes de schémas. (Première partie). Rédigé avec la colloboration de J. Dieudonné
+Normal rank
@@ Property / cites work @@
+Approaching the Chasm at Depth Four
@@ Property / cites work: Approaching the Chasm at Depth Four / rank @@
+Normal rank
@@ Property / cites work @@
+Arithmetic Circuits: A Chasm at Depth 3
@@ Property / cites work: Arithmetic Circuits: A Chasm at Depth 3 / rank @@
+Normal rank
@@ Property / cites work @@
+Semi-Algebraic Local-Triviality in Semi-Algebraic Mappings
+Normal rank
@@ Property / cites work @@
+On the Computational Complexity of Algorithms
@@ Property / cites work: On the Computational Complexity of Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Equations for Lower Bounds on Border Rank
@@ Property / cites work: Equations for Lower Bounds on Border Rank / rank @@
+Normal rank
@@ Property / cites work @@
+Q3942397
@@ Property / cites work: Q3942397 / rank @@
+Normal rank
@@ Property / cites work @@
+Lower bounds for polynomials with algebraic coefficients
+Normal rank
@@ Property / cites work @@
+Marginal hitting sets imply super-polynomial lower bounds for permanent
+Normal rank
@@ Property / cites work @@
+Permanent does not have succinct polynomial size arithmetic circuits of constant depth
+Normal rank
@@ Property / cites work @@
+Circuit-size lower bounds and non-reducibility to sparse sets
+Normal rank
@@ Property / cites work @@
+Q5365127
@@ Property / cites work: Q5365127 / rank @@
+Normal rank
@@ Property / cites work @@
+Arithmetic circuits: the chasm at depth four gets wider
+Normal rank
@@ Property / cites work @@
+VPSPACE and a transfer theorem over the reals
@@ Property / cites work: VPSPACE and a transfer theorem over the reals / rank @@
+Normal rank
@@ Property / cites work @@
+Using Elimination Theory to construct Rigid Matrices
+Normal rank
@@ Property / cites work @@
+Geometry of orbits of permanents and determinants
@@ Property / cites work: Geometry of orbits of permanents and determinants / rank @@
+Normal rank
@@ Property / cites work @@
+The border rank of the multiplication of $2\times 2$ matrices is seven
+Normal rank
@@ Property / cites work @@
+Geometry and the complexity of matrix multiplication
+Normal rank
@@ Property / cites work @@
+New Lower Bounds for the Rank of Matrix Multiplication
+Normal rank
@@ Property / cites work @@
+New lower bounds for the border rank of matrix multiplication
+Normal rank
@@ Property / cites work @@
+Hypersurfaces with degenerate duals and the geometric complexity theory program
+Normal rank
@@ Property / cites work @@
+Lower bounds for the circuit size of partially homogeneous polynomials
+Normal rank
@@ Property / cites work @@
+Characterizing Valiant's algebraic complexity classes
+Normal rank
@@ Property / cites work @@
+The rank of \(n \times n\) matrix multiplication is at least \(3n^2 - 2\sqrt{2}n^{\frac{3}{2}} - 3n\)
+Normal rank
@@ Property / cites work @@
+Q3882554
@@ Property / cites work: Q3882554 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4661386
@@ Property / cites work: Q4661386 / rank @@
+Normal rank
@@ Property / cites work @@
+Lower Bounds in a Parallel Model without Bit Operations
+Normal rank
@@ Property / cites work @@
+Q3675549
@@ Property / cites work: Q3675549 / rank @@
+Normal rank
@@ Property / cites work @@
+On P vs. NP and geometric complexity theory
@@ Property / cites work: On P vs. NP and geometric complexity theory / rank @@
+Normal rank
@@ Property / cites work @@
+Geometric Complexity Theory I: An Approach to the<i>P</i>vs.<i>NP</i>and Related Problems
+Normal rank
@@ Property / cites work @@
+Geometric Complexity Theory II: Towards Explicit Obstructions for Embeddings among Class Varieties
+Normal rank
@@ Property / cites work @@
+Q4128900
@@ Property / cites work: Q4128900 / rank @@
+Normal rank
@@ Property / cites work @@
+Computational complexity of parametric linear programming
+Normal rank
@@ Property / cites work @@
+Hardness vs randomness
@@ Property / cites work: Hardness vs randomness / rank @@
+Normal rank
@@ Property / cites work @@
+Lower bounds on arithmetic circuits via partial derivatives
+Normal rank
@@ Property / cites work @@
+Unimodality via Kronecker products
@@ Property / cites work: Unimodality via Kronecker products / rank @@
+Normal rank
@@ Property / cites work @@
+Q3002768
@@ Property / cites work: Q3002768 / rank @@
+Normal rank
@@ Property / cites work @@
+Multi-linear formulas for permanent and determinant are of super-polynomial size
+Normal rank
@@ Property / cites work @@
+Q3002820
@@ Property / cites work: Q3002820 / rank @@
+Normal rank
@@ Property / cites work @@
+Tensor-rank and lower bounds for arithmetic formulas
+Normal rank
@@ Property / cites work @@
+A Lower Bound for the Size of Syntactically Multilinear Arithmetic Circuits
+Normal rank
@@ Property / cites work @@
+Lower bounds and separations for constant depth multilinear circuits
+Normal rank
@@ Property / cites work @@
+Lower bounds on the size of bounded depth circuits over a complete basis with logical addition
+Normal rank
@@ Property / cites work @@
+Q4850554
@@ Property / cites work: Q4850554 / rank @@
+Normal rank
@@ Property / cites work @@
+Unprovability of lower bounds on circuit size in certain fragments of bounded arithmetic
+Normal rank
@@ Property / cites work @@
+Natural proofs
@@ Property / cites work: Natural proofs / rank @@
+Normal rank
@@ Property / cites work @@
+Partial and Total Matrix Multiplication
@@ Property / cites work: Partial and Total Matrix Multiplication / rank @@
+Normal rank
@@ Property / cites work @@
+Q4302492
@@ Property / cites work: Q4302492 / rank @@
+Normal rank
@@ Property / cites work @@
+Depth-3 arithmetic circuits over fields of characteristic zero
+Normal rank
@@ Property / cites work @@
+Die Berechnungskomplexität von elementarsymmetrischen Funktionen und von Interpolationskoeffizienten
+Normal rank
@@ Property / cites work @@
+Polynomials with Rational Coefficients Which are Hard to Compute
+Normal rank
@@ Property / cites work @@
+Rank and optimal computation of generic tensors
@@ Property / cites work: Rank and optimal computation of generic tensors / rank @@
+Normal rank
@@ Property / cites work @@
+Relative bilinear complexity and matrix multiplication.
+Normal rank
@@ Property / cites work @@
+Q5792485
@@ Property / cites work: Q5792485 / rank @@
+Normal rank
@@ Property / cites work @@
+Improved Bounds for Reduction to Depth 4 and Depth 3
+Normal rank
@@ Property / cites work @@
+Q4164821
@@ Property / cites work: Q4164821 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4680541
@@ Property / cites work: Q4680541 / rank @@
+Normal rank
@@ Property / cites work @@
+Multiplying matrices faster than coppersmith-winograd
+Normal rank
@@ Property / cites work @@
+Inductive time-space lower bounds for SAT and related problems
+Normal rank
@@ Property / cites work @@
+Time-space tradeoffs for counting NP solutions modulo integers
+Normal rank
@@ Property / cites work @@
+Natural Proofs versus Derandomization
@@ Property / cites work: Natural Proofs versus Derandomization / rank @@
+Normal rank
@@ Property / cites work @@
+Nonuniform ACC Circuit Lower Bounds
@@ Property / cites work: Nonuniform ACC Circuit Lower Bounds / rank @@
+Normal rank
@@ Property / cites work @@
+Lower Bounds for Algebraic Computation Trees of Functions with Finite Domains
+Normal rank
@@ Property / cites work @@
+Decision tree complexity and Betti numbers
@@ Property / cites work: Decision tree complexity and Betti numbers / rank @@
+Normal rank
@@ Property / cites work @@
+A bad network problem for the simplex method and other minimum cost flow algorithms
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2351393