Find link

language:

Find link is a tool written by Edward Betts.

searching for Computational topology 12 found (56 total)

NP-intermediate (1,534 words) [view diff] no match in snippet view article find links to article

In computational complexity, problems that are in the complexity class NP but are neither in the class P nor NP-complete are called NP-intermediate, and

Valerio Pascucci (428 words) [view diff] case mismatch in snippet view article find links to article

Performance Computing, large scale scientific data management, and Computational Topology. Valerio received his MS in electrical engineering in 1993 from

Dmitry Feichtner-Kozlov (548 words) [view diff] case mismatch in snippet view article find links to article

Machinery. He is a managing editor of the Journal of Applied and Computational Topology, published by Springer-Verlag. Feichtner-Kozlov is married to Eva-Maria

Topological complexity (388 words) [view diff] case mismatch in snippet view article find links to article

"Topological complexity of the Klein bottle". Journal of Applied and Computational Topology. 1 (2): 199–213. arXiv:1612.03133. doi:10.1007/s41468-017-0002-0

Herbert Edelsbrunner (722 words) [view diff] case mismatch in snippet view article find links to article

Generation (Cambridge University Press, 2001, ISBN 978-0-521-79309-4), Computational Topology (American Mathematical Society, 2009, 978-0821849255) and A Short

Random geometric graph (2,603 words) [view diff] case mismatch in snippet view article find links to article

of random geometric complexes: a survey". Journal of Applied and Computational Topology. 1 (3–4): 331–364. arXiv:1409.4734. doi:10.1007/s41468-017-0010-0

Lou Kondic (639 words) [view diff] exact match in snippet view article find links to article

the nanoscale. He has also worked extensively on applications of computational topology, in particular persistence homology, to the analysis of interaction

Multicover bifiltration (608 words) [view diff] case mismatch in snippet view article find links to article

multiparameter persistent Betti numbers". Journal of Applied and Computational Topology. 8 (6): 1465–1502. arXiv:2109.05513. doi:10.1007/s41468-022-00110-9

Homology (mathematics) (8,273 words) [view diff] case mismatch in snippet view article

incompatibility (help) Herbert Edelsbrunner and John L. Harer (2010): Computational Topology: An Introduction, American Mathematical Society Eilenberg, Samuel;

Free abelian group (6,773 words) [view diff] case mismatch in snippet view article find links to article

ISBN 9781584880509 Edelsbrunner, Herbert; Harer, John (2010), Computational Topology: An Introduction, Providence, Rhode Island: American Mathematical

Sergio Rajsbaum (1,049 words) [view diff] case mismatch in snippet view article find links to article

applications to Weak Symmetry Breaking". Journal of Applied and Computational Topology. 1: 1–55. arXiv:1511.00457. doi:10.1007/s41468-017-0001-1. Fajstrup

Discrete calculus (6,492 words) [view diff] case mismatch in snippet view article find links to article

Mathematics. Springer. ISBN 0387979263. Kaczynski, Tomasz; Mischaikow, Konstantin; Mrozek, Marian (2004). Computational Topology. Springer. ISBN 0-387-40853-3.