Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with computational-topology
Search options not deleted
user 4558
Computational topology is the study of decidability problems in topology and the algorithms that determine decidability. Examples of area of study include Normal Surface theory and the subproblems of unknot and $S^3$ recognition.
11
votes
Computational software in Algebraic Topology?
(1) The Computational Homology Project offers free software CHomP that will compute homology of simplicial complexes, at least with finite field coefficients.
(2) Dionysus, from the computational top …
- 7,857
6
votes
Is being simply connected very rare?
The following does not answer your question, but adding just in case it is helpful.
If you weaken "simply connected" to $H_1(\Delta, \mathbb{Q}) = 0$, and weaken "every vertex is in a bounded number o …
- 7,857