On iterated integer product

DOI10.1016/0020-0190(92)90035-TMaRDI QIDQ1198074zbMATH OpenFDO

Authors Bruce Litow

Publication date 16 January 1993

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

zbMATH Keywords

complexityiterated product

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Number-theoretic algorithms; complexity (11Y16)

Recommendations

• Bits and relative order from residues, space efficiently
• On the complexity of integer matrix multiplication
• Integer multiplication in time \(O(n\log n)\)
• New results on the complexity of the middle bit of multiplication
• On realizing iterated multiplication by small depth threshold circuits

Cites work

• scientific article; zbMATH DE number 3657869 (Why is no real title available?)
• A taxonomy of problems with fast parallel algorithms
• Fast Parallel Arithmetic via Modular Representation
• Log Depth Circuits for Division and Related Problems
• Logarithmic Depth Circuits for Algebraic Functions
• On Relating Time and Space to Size and Depth
• On uniform circuit complexity

Cited in

(5)

• Computing a context-free grammar-generating series
• Bits and relative order from residues, space efficiently
• Nondeterministic NC^1 computation
• On \(\text{TC}^0,\text{AC}^0\), and arithmetic circuits
• ON ITERATED PRODUCT SETS WITH SHIFTS

This page was built for publication: On iterated integer product

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