Threshold Circuits for Iterated Matrix Product and Powering
From MaRDI portal
Publication:4494480
DOI10.1051/ita:2000105zbMath0962.68089MaRDI 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/
68Q25: Analysis of algorithms and problem complexity
68Q45: Formal languages and automata
68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)
Related Items
Threshold Circuits for Iterated Matrix Product and Powering, On the complexity of algebraic numbers, and the bit-complexity of straight-line programs1, Processing succinct matrices and vectors
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