scientific article; zbMATH DE number 7561749
From MaRDI portal
Publication:5092471
DOI10.4230/LIPIcs.CCC.2020.21MaRDI QIDQ5092471
Christian Ikenmeyer, Anurag Pandey, Markus Bläser, Meena Mahajan, Nitin Saurabh
Publication date: 21 July 2022
Full work available at URL: https://arxiv.org/abs/2003.04834
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
flowslower boundstangent spacesalgebraic branching programsgeometric complexity theoryVNPborder complexityVQP
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the power of algebraic branching programs of width two
- Geometric aspects of iterated matrix multiplication
- The boundary of the orbit of the 3-by-3 determinant polynomial
- Correction to: ``The complexity of factors of multivariate polynomials
- Lower bounds for polynomials with algebraic coefficients
- Relations between exact and approximate bilinear algorithms. Applications
- \(0(n^{2.7799})\) complexity for \(n\times n\) approximate matrix multiplication
- Completeness and reduction in algebraic complexity theory
- Geometric complexity theory and matrix powering
- The complexity of factors of multivariate polynomials
- A quadratic lower bound for homogeneous algebraic branching programs
- Geometric complexity theory: an introduction for geometers
- A lower bound for the determinantal complexity of a hypersurface
- Characterizing Valiant's algebraic complexity classes
- Geometric Complexity Theory I: An Approach to thePvs.NPand Related Problems
- An Overview of Mathematical Issues Arising in the Geometric Complexity Theory Approach to $\mathbf{VP}\neq\mathbf{VNP}$
- Geometric Complexity Theory II: Towards Explicit Obstructions for Embeddings among Class Varieties
- Computing Algebraic Formulas Using a Constant Number of Registers
- Boundaries of VP and VNP
- On Algebraic Branching Programs of Small Width
- Polynomials with Rational Coefficients Which are Hard to Compute
- Reconstruction of Full Rank Algebraic Branching Programs
- Separating monotone VP and VNP
- Identity testing and lower bounds for read- k oblivious algebraic branching programs
- Tensor-Rank and Lower Bounds for Arithmetic Formulas
This page was built for publication:
