A logarithmic Boolean time algorithm for parallel polynomial division
type: Item
instance of: scholarly article
title: A logarithmic Boolean time algorithm for parallel polynomial division
zbMATH Open document ID: 0653.68017
DOI: 10.1016/0020-0190(87)90139-6
published in: Information Processing Letters
publication date: 1987-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 65F05
Mathematics Subject Classification ID: 12-04
zbMATH DE Number: 4066311
zbMATH Keywords: parallel computational complexity
zbMATH Keywords: Boolean circuit complexity
zbMATH Keywords: polynomial division
zbMATH Keywords: triangular Toeplitz matrix inversion
zbMATH Keywords: interpolation by binary segmentation
zbMATH Keywords: division with remainder
zbMATH Keywords: integer polynomials
author: Dario A. Bini
author: Victor Y. Pan
MaRDI profile type: Publication
full work available at URL: 0020-0190(87)90139-6
OpenAlex ID: W2086472440
cites work: Parallel Solution of Certain Toeplitz Linear Systems
cites work: Polynomial division and its computational complexity
cites work: Q4190138
cites work: Fast parallel matrix and GCD computations
cites work: Q4055156
cites work: Q5653524
cites work: Q3935355
cites work: The bit-operation complexity of matrix multiplication and of all pair shortest path problem
cites work: How to multiply matrices faster
cites work: The bit complexity of matrix multiplication and of related computations in linear algebra. The segmented \(\lambda\) algorithms
cites work: Computational complexity of computing polynomials over the fields of real and complex numbers
cites work: Logarithmic Depth Circuits for Algebraic Functions
cites work: Q4138141
cites work: Q3325040
description: scientific article; zbMATH DE number 4066311