Lower Bounds for the Sum of Small-Size Algebraic Branching Programs
Book chapter (May 2024)
Algebraic Complexity Theory
Overview of attention for book
Table of Contents
-
Altmetric BadgeBook Overview
-
Altmetric BadgeChapter 1 Introduction
-
Altmetric BadgeChapter 2 Efficient Polynomial Arithmetic
-
Altmetric BadgeChapter 3 Efficient Algorithms with Branching
-
Altmetric BadgeChapter 4 Models of Computation
-
Altmetric BadgeChapter 5 Preconditioning and Transcendence Degree
-
Altmetric BadgeChapter 6 The Substitution Method
-
Altmetric BadgeChapter 7 Differential Methods
-
Altmetric BadgeChapter 8 The Degree Bound
-
Altmetric BadgeChapter 9 Specific Polynomials which Are Hard to Compute
-
Altmetric BadgeChapter 10 Branching and Degree
-
Altmetric BadgeChapter 11 Branching and Connectivity
-
Altmetric BadgeChapter 12 Additive Complexity
-
Altmetric BadgeChapter 13 Linear Complexity
-
Altmetric BadgeChapter 14 Multiplicative and Bilinear Complexity
-
Altmetric BadgeChapter 15 Asymptotic Complexity of Matrix Multiplication
-
Altmetric BadgeChapter 16 Problems Related to Matrix Multiplication
-
Altmetric BadgeChapter 17 Lower Bounds for the Complexity of Algebras
-
Altmetric BadgeChapter 18 Rank over Finite Fields and Codes
-
Altmetric BadgeChapter 19 Rank of 2-Slice and 3-Slice Tensors
-
Altmetric BadgeChapter 20 Typical Tensorial Rank
-
Altmetric BadgeChapter 21 P Versus NP: A Nonuniform Algebraic Analogue