An Optimal Complexity Algorithm for Computing the Topological Degree in Two Dimensions (Q4733311)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An Optimal Complexity Algorithm for Computing the Topological Degree in Two Dimensions |
scientific article; zbMATH DE number 4119506
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An Optimal Complexity Algorithm for Computing the Topological Degree in Two Dimensions |
scientific article; zbMATH DE number 4119506 |
Statements
An Optimal Complexity Algorithm for Computing the Topological Degree in Two Dimensions (English)
0 references
1989
0 references
Lipschitz function
0 references
topological degree
0 references
worst-case lower bound
0 references
number of function evaluations
0 references
complexity
0 references
algorithm
0 references
