Determinants vs. algebraic branching programs
type: Item
instance of: scholarly article
title: Determinants vs. algebraic branching programs
author: Abhranil Chatterjee
author: Mrinal Kumar
author: Ben Lee Volk
published in: Computational Complexity
publication date: 2024-10-25T00:00:00Z
Mathematics Subject Classification ID: 68Q06
Mathematics Subject Classification ID: 68Q15
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 7932029
zbMATH Keywords: determinantal complexity
zbMATH Keywords: algebraic complexity theory
zbMATH Keywords: lower bounds
zbMATH Keywords: algebraic circuits
zbMATH Keywords: algebraic branching programs
MaRDI profile type: Publication
cites work: A lower bound for the determinantal complexity of a hypersurface
cites work: The complexity of partial derivatives
cites work: On computing the determinant in small parallel time using a small number of processors
cites work: Quadratic lower bound for permanent vs. determinant in any characteristic
cites work: Quadratic lower bounds for algebraic branching programs and formulas
cites work: Permanent and determinant
cites work: A Lower Bound for the Formula Size of Rational Functions
cites work: A quadratic lower bound for homogeneous algebraic branching programs
cites work: A lower bound on determinantal complexity
cites work: Permanent v. determinant: an exponential lower bound assuming symmetry and a potential path towards Valiant's conjecture
cites work: Complexity Lower Bounds using Linear Algebra
cites work: Q5501853
cites work: Q4661386
cites work: Q3002820
cites work: Q4967171
cites work: Lower bounds for polynomial evaluation and interpolation problems
cites work: Die Berechnungskomplexität von elementarsymmetrischen Funktionen und von Interpolationskoeffizienten
cites work: Q4138137
cites work: Q4164821
DOI: 10.1007/S00037-024-00258-Z
description: scientific article; zbMATH DE number 7932029