Arrow Research search
Back to FOCS

FOCS 1987

Some Polynomial and Toeplitz Matrix Computations

Conference Paper Accepted Paper Algorithms and Complexity · Theoretical Computer Science

Abstract

No abstract is available in the live database for this paper.

Authors

Keywords

  • Polynomials
  • Arithmetic
  • Concurrent computing
  • Newton method
  • Computer applications
  • Parallel algorithms
  • Complexity theory
  • Circuit testing
  • Upper bound
  • Toeplitz Matrix
  • Polynomial Computation
  • Polynomial Of Degree
  • Complex Integration
  • Arithmetic Operations
  • Parallel Algorithm
  • Geometric Construction
  • Poles And Zeros
  • Binary Bits
  • Parallel Steps
  • Computational Complexity
  • Time Sequence
  • Structure Of Matrix
  • Application Of Algorithm
  • Side Length
  • Discrete Fourier Transform
  • Complex Domain
  • Direct Component
  • N Log N
  • Padé Approximation
  • Characteristic Polynomial
  • Tree Edges
  • Finite Precision
  • Recursive Step
  • Logarithmic Factor
  • Greatest Common Divisor
  • Triangular Matrix

Context

Venue
IEEE Symposium on Foundations of Computer Science
Archive span
1975-2025
Indexed papers
3809
Paper id
530744915987943275
v2026.09.13