New Block Recombination for Subquadratic Space Complexity Polynomial Multiplication Based on Overlap-Free Approach

DOI10.1109/TC.2017.2669998zbMATH Open1373.68463OpenAlexW2588169056WikidataQ122454346 ScholiaQ122454346MaRDI QIDQ4589516FDOQ4589516

Changho Seo, Dowon Hong, Ku-Young Chang, Sun-Mi Park

Publication date: 10 November 2017

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tc.2017.2669998

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Analysis of algorithms (68W40) Parallel algorithms in computer science (68W10)

This page was built for publication: New Block Recombination for Subquadratic Space Complexity Polynomial Multiplication Based on Overlap-Free Approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4589516)