Lower bounds for arithmetic networks. II: Sum of Betti numbers

DOI10.1007/BF01613615MaRDI QIDQ1908901zbMATH OpenOpenAlexFDO

Authors J. E. Morais, J. L. Montaña, Luis Miguel Pardo

Publication date 5 May 1996

Published in Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01613615

zbMATH Keywords

semialgebraic setsparallel complexitymembership problems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30)

Recommendations

• Topological lower bounds for arithmetic networks
• Lower bounds for arithmetic networks
• On topological lower bounds for algebraic computation trees
• On bounding the Betti numbers and computing the Euler characteristic of semi-algebraic sets

Cites work

• scientific article; zbMATH DE number 3919830 (Why is no real title available?)
• scientific article; zbMATH DE number 3785798 (Why is no real title available?)
• scientific article; zbMATH DE number 16658 (Why is no real title available?)
• scientific article; zbMATH DE number 1256662 (Why is no real title available?)
• scientific article; zbMATH DE number 3999284 (Why is no real title available?)
• A theory of complexity, condition, and roundoff
• Complexity of deciding Tarski algebra
• Definability and fast quantifier elimination in algebraically closed fields
• Lower bounds for algebraic decision trees
• Lower bounds for arithmetic networks
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• On the Betti Numbers of Real Varieties
• On the complexity of computations under varying sets of primitives
• On the topology of algorithms. I
• TIME BOUNDED COMPUTATIONS OVER THE REALS

Cited in

(11)

• Topological complexity of the relative closure of a semi-Pfaffian couple
• A complexity theory of constructible functions and sheaves
• Lower bounds for diophantine approximations
• Kronecker's and Newton's approaches to solving: a first comparison
• Semi-algebraic decision complexity, the real spectrum, and degree
• scientific article; zbMATH DE number 4047106 (Why is no real title available?)
• Bounding the equivariant Betti numbers of symmetric semi-algebraic sets
• Topological lower bounds for arithmetic networks
• Nearly sharp complexity bounds for multiprocessor algebraic computations
• Lower bounds for arithmetic networks
• Lower bound on testing membership to a polyhedron by algebraic decision and computation trees

This page was built for publication: Lower bounds for arithmetic networks. II: Sum of Betti numbers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1908901)