Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Fete of Combinatorics and Computer ScienceBetti Numbers are Testable*

Fete of Combinatorics and Computer Science: Betti Numbers are Testable* [We prove that the Betti numbers of simplicial complexes of bounded vertex degrees are testable in constant time.] http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png

Fete of Combinatorics and Computer ScienceBetti Numbers are Testable*

Part of the Bolyai Society Mathematical Studies Book Series (volume 20)
Editors: Katona, Gyula O. H.; Schrijver, Alexander; Szőnyi, Tamás; Sági, Gábor
Elek, Gábor
Fete of Combinatorics and Computer Science — Jan 31, 2011
Download PDF
10 pages

Loading next page...
 
/lp/springer-journals/fete-of-combinatorics-and-computer-science-betti-numbers-are-testable-eawPI0LyU5
Publisher
Springer Berlin Heidelberg
Copyright
© János Bolyai Mathematical Society and Springer-Verlag 2010
ISBN
978-3-642-13579-8
Pages
139 –149
DOI
10.1007/978-3-642-13580-4_6
Publisher site
See Chapter on Publisher Site

Abstract

[We prove that the Betti numbers of simplicial complexes of bounded vertex degrees are testable in constant time.]

Published: Jan 31, 2011

Keywords: Simplicial Complex; Betti Number; Convergent Sequence; Regularity Lemma; Short Path Distance

There are no references for this article.