A div(n) depth Boolean circuit for smooth modular inverse

DOI10.1016/0020-0190(91)90238-DMaRDI QIDQ808255zbMATHOpenAlexFDO

Authors Michal Mňuk

Publication date 1991

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(91)90238-d

zbMATH Keywords

Boolean circuits

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Distributed algorithms (68W15)

Recommendations

• scientific article; zbMATH DE number 19771
• scientific article; zbMATH DE number 4064464
• Log Depth Circuits for Division and Related Problems
• Fast Parallel Arithmetic via Modular Representation
• Optimal Size Integer Division Circuits

Cites work

• scientific article; zbMATH DE number 3845710 (Why is no real title available?)
• scientific article; zbMATH DE number 4064464 (Why is no real title available?)
• scientific article; zbMATH DE number 4128395 (Why is no real title available?)
• Computing Powers in Parallel
• Log Depth Circuits for Division and Related Problems
• Logarithmic Depth Circuits for Algebraic Functions

Cited in

(2)

• Fast Parallel Arithmetic via Modular Representation
• Log Depth Circuits for Division and Related Problems

This page was built for publication: A div(n) depth Boolean circuit for smooth modular inverse

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