最終更新日:2022/12/24
The algorithms in 26, 28 yield (up to polylog factors) these nearly optimal precision and Boolean cost bounds for the worst case polynomial rootfinding.
編集履歴(0)
The algorithms in 26, 28 yield (up to polylog factors) these nearly optimal precision and Boolean cost bounds for the worst case polynomial rootfinding.