Corrections to “A Universal Architecture for Designing Efficient Modulo<tex>$2^n+1$</tex>Multipliers”
From MaRDI portal
Publication:4590468
DOI10.1109/TCSI.2005.856130zbMath1374.68020WikidataQ59357603 ScholiaQ59357603MaRDI QIDQ4590468
No author found.
Publication date: 20 November 2017
Published in: IEEE Transactions on Circuits and Systems I: Regular Papers (Search for Journal in Brave)
Number-theoretic algorithms; complexity (11Y16) Mathematical problems of computer architecture (68M07)
Related Items (1)
This page was built for publication: Corrections to “A Universal Architecture for Designing Efficient Modulo<tex>$2^n+1$</tex>Multipliers”