pith. sign in

arxiv: 1510.03387 · v3 · pith:4NWI6BFLnew · submitted 2015-10-12 · 💻 cs.CC · math.AG

Topological lower bounds for arithmetic networks

classification 💻 cs.CC math.AG
keywords lowerbettiboundnumberssemialgebraictermsarithmeticnetworks
0
0 comments X
read the original abstract

We prove a complexity lower bound on deciding membership in a semialgebraic set for arithmetic networks in terms of the sum of Betti numbers with respect to "ordinary" (singular) homology. This result complements a similar lower bound by Montana, Morais and Pardo for locally close semialgebraic sets in terms of the sum of Borel-Moore Betti numbers. We also prove a lower bound in terms of the sum of Betti numbers of the projection of a semialgebraic set to a coordinate subspace.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.