![]() |
|
|
| |
|
||||
Algorithmic topology, or computational topology, is a subfield of topology with an overlap with areas of computer science, in particular computational complexity theory. A primary concern of algorithmic topology, as its name suggests, is to develop efficient algorithms for solving topological problems. For example, an open problem is to find a polynomial time algorithm to see if a knot is unknotted. Some parts of algorithmic topology can be considered experimental mathematics. External Links
|
|
|
|
|
|
|
|
Copyright 2008 WordIQ.com - Privacy Policy
::
Terms of Use
:: Contact Us
:: About Us This article is licensed under the GNU Free Documentation License. It uses material from the Wikipedia article "Algorithmic topology". |