Computing the Homology of Semialgebraic Sets. I: Lax Formulas

We describe and analyze an algorithm for computing the homology (Betti numbers and torsion coefficients) of closed semialgebraic sets given by Boolean formulas without negations over lax polynomial inequalities. The algorithm works in weak exponential time. This means that outside a subset of data h...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Foundations of computational mathematics Ročník 20; číslo 1; s. 71 - 118
Hlavní autori:	Bürgisser, Peter, Cucker, Felipe, Tonelli-Cueto, Josué
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.02.2020 Springer Nature B.V
Predmet:	Acceleration Algorithms Applications of Mathematics Boolean algebra Computation Computer Science Economics Homology Linear and Multilinear Algebras Math Applications in Computer Science Mathematics Mathematics and Statistics Matrix Theory Numerical Analysis Polynomials 68Q25 Homology groups Numerical algorithms 14P10 65Y20 Weak complexity 65D18
ISSN:	1615-3375, 1615-3383
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!