A logarithmic Boolean time algorithm for parallel polynomial division (Q1107986): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Dario Andrea Bini / rank
 
Normal rank
Property / author
 
Property / author: Pan, Victor Y. / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0020-0190(87)90139-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2086472440 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Solution of Certain Toeplitz Linear Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial division and its computational complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4190138 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast parallel matrix and GCD computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4055156 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5653524 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3935355 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The bit-operation complexity of matrix multiplication and of all pair shortest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to multiply matrices faster / rank
 
Normal rank
Property / cites work
 
Property / cites work: The bit complexity of matrix multiplication and of related computations in linear algebra. The segmented \(\lambda\) algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational complexity of computing polynomials over the fields of real and complex numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logarithmic Depth Circuits for Algebraic Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4138141 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3325040 / rank
 
Normal rank

Latest revision as of 17:46, 18 June 2024

scientific article
Language Label Description Also known as
English
A logarithmic Boolean time algorithm for parallel polynomial division
scientific article

    Statements

    A logarithmic Boolean time algorithm for parallel polynomial division (English)
    0 references
    1987
    0 references
    parallel computational complexity
    0 references
    Boolean circuit complexity
    0 references
    polynomial division
    0 references
    triangular Toeplitz matrix inversion
    0 references
    interpolation by binary segmentation
    0 references
    division with remainder
    0 references
    integer polynomials
    0 references
    0 references
    0 references

    Identifiers