On the complexity of the Plantinga-Vegter algorithm (Q2172649): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q114229299, #quickstatements; #temporary_batch_1722357939539 |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s00454-022-00403-x / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S00454-022-00403-X / rank | |||
Normal rank | |||
Latest revision as of 08:30, 17 December 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
0 references
0 references
0 references
0 references
0 references
