CATEGORICAL COMPLEXITY

DOI10.1017/fms.2020.26zbMath1452.18001arXiv1610.07737OpenAlexW2995924776MaRDI QIDQ3304647

Saugata Basu, Umut Isik

Publication date: 3 August 2020

Published in: Forum of Mathematics, Sigma (Search for Journal in Brave)

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

zbMATH Keywords

graph theorycategory theoryalgebraic geometrycomplexity theoryarithmetic circuit

Mathematics Subject Classification ID

Effectivity, complexity and computational aspects of algebraic geometry (14Q20) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Graphs, diagram schemes, precategories (18A10)

Cites Work

• Effective Hironaka resolution and its complexity
• Algebraic geometry II
• The complexity of computing the permanent
• Feasible arithmetic computations: Valiant's hypothesis
• Sheaves in geometry and logic: a first introduction to topos theory
• Ubiquity of Łojasiewicz's example of a nonbasic semialgebraic set
• Completeness and reduction in algebraic complexity theory
• Complexity classes and completeness in algebraic geometry
• Polynomial hierarchy, Betti numbers, and a real analogue of Toda's theorem
• Connectivity of joins, cohomological quantifier elimination, and an algebraic Toda's theorem
• A complexity theory of constructible functions and sheaves
• An Introduction to Category Theory
• Greatest common divisors of polynomials given by straight-line programs
• Geometric Invariant Theory
• COMPLEXITY AND REAL COMPUTATION: A MANIFESTO
• Algorithms in real algebraic geometry
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: CATEGORICAL COMPLEXITY