scientific article; zbMATH DE number 7561749

DOI10.4230/LIPICS.CCC.2020.21MaRDI QIDQ5092471FDOQ5092471

Authors: Markus Bläser, Christian Ikenmeyer, Meena Mahajan, Anurag Pandey, Nitin Saurabh 

Publication date: 21 July 2022

Full work available at URL: https://arxiv.org/abs/2003.04834

Title of this publication is not available (Why is that?)

zbMATH Keywords

lower boundsalgebraic branching programsflowsgeometric complexity theorytangent spacesVNPborder complexityVQP

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cites Work

• Graph theory
• On the power of algebraic branching programs of width two
• Computing Algebraic Formulas Using a Constant Number of Registers
• Characterizing Valiant's algebraic complexity classes
• Completeness and reduction in algebraic complexity theory
• Lower bounds for polynomials with algebraic coefficients
• Geometric complexity theory: an introduction for geometers
• Geometric aspects of iterated matrix multiplication
• 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
• Polynomials with Rational Coefficients Which are Hard to Compute
• \(0(n^{2.7799})\) complexity for \(n\times n\) approximate matrix multiplication
• Geometric complexity theory and matrix powering
• Geometric complexity theory. I: An approach to the P vs. NP and related problems
• The boundary of the orbit of the 3-by-3 determinant polynomial
• The complexity of factors of multivariate polynomials
• Relations between exact and approximate bilinear algorithms. Applications
• Reconstruction of full rank algebraic branching programs
• Correction to: ``The complexity of factors of multivariate polynomials
• A lower bound for the determinantal complexity of a hypersurface
• Title not available (Why is that?)
• Identity testing and lower bounds for read-\(k\) oblivious algebraic branching programs
• On Algebraic Branching Programs of Small Width
• A quadratic lower bound for homogeneous algebraic branching programs
• Tensor-rank and lower bounds for arithmetic formulas
• Separating monotone VP and VNP
• Boundaries of VP and VNP
• Title not available (Why is that?)

Cited In (4)

• On Algebraic Branching Programs of Small Width
• On the closures of monotone algebraic classes and variants of the determinant
• Algorithmic aspects of branched coverings I/V. Van Kampen's theorem for bisets
• On the closures of monotone algebraic classes and variants of the determinant

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5092471)