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

DOI10.1016/0020-0190(91)90238-DzbMATH Open0731.68050OpenAlexW2106855461MaRDI QIDQ808255FDOQ808255

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

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

zbMATH Keywords

Boolean circuits

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Log Depth Circuits for Division and Related Problems
• Title not available (Why is that?)
• Computing Powers in Parallel
• Logarithmic Depth Circuits for Algebraic Functions
• Title not available (Why is that?)

Cited In (2)

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

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)