Threshold Circuits for Iterated Matrix Product and Powering

DOI10.1051/ita:2000105zbMath0962.68089OpenAlexW2123814675MaRDI QIDQ4494480

Carlo Mereghetti, Beatrice Palano

Publication date: 13 June 2001

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=ITA_2000__34_1_39_0/

zbMATH Keywords

complexity of computing

Mathematics Subject Classification ID

Related Items (3)

Processing succinct matrices and vectors ⋮ On the complexity of algebraic numbers, and the bit-complexity of straight-line programs1 ⋮ Threshold Circuits for Iterated Matrix Product and Powering

Cites Work

• Regular languages in \(NC\)
• Optimal lower bounds on the depth of polynomial-size threshold circuits for some arithmetic functions
• Very Fast Parallel Polynomial Arithmetic
• A taxonomy of problems with fast parallel algorithms
• Threshold Circuits for Iterated Matrix Product and Powering
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Threshold Circuits for Iterated Matrix Product and Powering