On the complexity of the Plantinga-Vegter algorithm (Q2172649): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 00:48, 2 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of the Plantinga-Vegter algorithm |
scientific article |
Statements
On the complexity of the Plantinga-Vegter algorithm (English)
0 references
16 September 2022
0 references
Plantinga-Vegter algorithm
0 references
subdivision methods
0 references
complexity analysis
0 references
