STOC 1995
Optimal (up to polylog factors) sequential and parallel algorithms for approximating complex polynomial zeros
Abstract
No abstract is available in the live database for this paper.
Authors
Keywords
No keywords are indexed for this paper.
Context
- Venue
- ACM Symposium on Theory of Computing
- Archive span
- 1969-2025
- Indexed papers
- 4364
- Paper id
- 598746187890945280