Logo
ScienceStack
Table of Contents
Fetching ...
Sign In

Recent Advances in Debordering Methods

Pranjal Dutta, Vladimir Lysikov

TL;DR

This survey surveys debordering in algebraic complexity, linking border complexity to central questions like VP vs VNP and the determinant vs permanent problem. It develops two main threads: algebraic characterizations of border complexity via algebro-geometric tools and concrete debordering results across restricted circuit models (ROABPs, depth-2 to depth-4 circuits, and Waring-type decompositions). By establishing equivalences between border definitions and one-parameter interpolations, the work highlights techniques to convert border results into non-border bounds and discusses implications for PIT derandomization and Geometric Complexity Theory. The results illuminate how border concepts can simplify or restructure complexity analyses, with universality and hierarchy phenomena revealing both potential and limitations of debordering in practical models. Overall, the survey clarifies the landscape of debordering methods and points to promising avenues for strengthening computational lower bounds through border-based approaches.

Abstract

Border complexity captures functions that can be approximated by low-complexity ones. Debordering is the task of proving an upper bound on some non-border complexity measure in terms of a border complexity measure, thus getting rid of limits. Debordering lies at the heart of foundational complexity theory questions relating Valiant's determinant versus permanent conjecture (1979) and its geometric complexity theory (GCT) variant proposed by Mulmuley and Sohoni (2001). The debordering of matrix multiplication tensors by Bini (1980) played a pivotal role in the development of efficient matrix multiplication algorithms. Consequently, debordering finds applications in both establishing computational complexity lower bounds and facilitating algorithm design. Recent years have seen notable progress in debordering various restricted border complexity measures. In this survey, we highlight these advances and discuss techniques underlying them.

Recent Advances in Debordering Methods

TL;DR

This survey surveys debordering in algebraic complexity, linking border complexity to central questions like VP vs VNP and the determinant vs permanent problem. It develops two main threads: algebraic characterizations of border complexity via algebro-geometric tools and concrete debordering results across restricted circuit models (ROABPs, depth-2 to depth-4 circuits, and Waring-type decompositions). By establishing equivalences between border definitions and one-parameter interpolations, the work highlights techniques to convert border results into non-border bounds and discusses implications for PIT derandomization and Geometric Complexity Theory. The results illuminate how border concepts can simplify or restructure complexity analyses, with universality and hierarchy phenomena revealing both potential and limitations of debordering in practical models. Overall, the survey clarifies the landscape of debordering methods and points to promising avenues for strengthening computational lower bounds through border-based approaches.

Abstract

Border complexity captures functions that can be approximated by low-complexity ones. Debordering is the task of proving an upper bound on some non-border complexity measure in terms of a border complexity measure, thus getting rid of limits. Debordering lies at the heart of foundational complexity theory questions relating Valiant's determinant versus permanent conjecture (1979) and its geometric complexity theory (GCT) variant proposed by Mulmuley and Sohoni (2001). The debordering of matrix multiplication tensors by Bini (1980) played a pivotal role in the development of efficient matrix multiplication algorithms. Consequently, debordering finds applications in both establishing computational complexity lower bounds and facilitating algorithm design. Recent years have seen notable progress in debordering various restricted border complexity measures. In this survey, we highlight these advances and discuss techniques underlying them.
Paper Structure (50 sections, 47 theorems, 112 equations, 3 figures)

This paper contains 50 sections, 47 theorems, 112 equations, 3 figures.

Table of Contents

  1. Introduction
  2. Algebraic circuits.
  3. Algebraic formulas and ABPs.
  4. Algebraic complexity classes.
  5. Geometric Complexity Theory
  6. Border Complexity
  7. Connection to matrix multiplication.
  8. Advantage using border complexity.
  9. Other connections and importance.
  10. Purpose of This Survey
  11. Preliminaries
  12. Notation:
  13. Arithmetic branching programs
  14. Read-once Oblivious Arithmetic Branching Programs
  15. Some Technical Lemmas
  16. ...and 35 more sections

Key Result

Lemma 1

Let $R$ be a commutative ring that contains a field $\mathbb F$ of at least $r + 1$ elements, and let $\alpha_0, \cdots, \alpha_r$ be distinct elements in $\mathbb F$. F. Then, there exists fields elements $\beta_0, \cdots, \beta_r$ such that for any $\sum_{i \ge 0} f_i x^i =: f(x) \in R[[x]]$, we h

Figures (3)

  • Figure 1: Addition construction for \ref{['cl:addition']}
  • Figure 2: Squaring construction for \ref{['cl:squaring']}
  • Figure 3: Squaring construction subroutines for $C$, $B$, and $A$ for \ref{['cl:squaring']}

Theorems & Definitions (111)

  • Lemma 1: Border Interpolation
  • proof : Proof sketch
  • Definition 2
  • Lemma 3: nisan1991lower
  • Proposition 4: Newton Identities, see e.g. Macdon:SymmetricFunctions, Section I.2
  • Proposition 5: Valiant's criterion Valiant79burgisser2000completeness
  • Definition 6: Border complexity
  • Definition 7
  • Theorem 8: shafarevich1994basic
  • Lemma 9
  • ...and 101 more