Classification of all the minimal bilinear algorithms for computing the coefficients of the product of two polynomials modulo a polynomial. Part II: The algebra G[u]/〈un〉
- Amir Averbuch
- Zvi Galil
- et al.
- 1991
- Theoretical Computer Science
Publications
Date
Featured collections
Popular topics
132 results at Theoretical Computer Science
Constant-round perfect zero-knowledge computationally convincing protocols
- Gilles Brassard
- Claude Crépeau
- et al.
- 1991
- Theoretical Computer Science
Size-depth trade-offs for monotone arithmetic circuits
- Marc Snir
- 1991
- Theoretical Computer Science
Accumulators: New logic variable abstractions for functional languages
- Keshav Pingali
- Kattamuri Ekanadham
- 1991
- Theoretical Computer Science
On total functions, existence theorems and computational complexity
- Nimrod Megiddo
- Christos H. Papadimitriou
- 1991
- Theoretical Computer Science
An algebraically specified language for data directed design
- Eric G. Wagner
- 1990
- Theoretical Computer Science
A complexity theory of efficient parallel algorithms
- Clyde P. Kruskal
- Larry Rudolph
- et al.
- 1990
- Theoretical Computer Science
Communication complexity of PRAMs
- Alok Aggarwal
- Ashok K. Chandra
- et al.
- 1990
- Theoretical Computer Science
Algebras, polynomials and programs
- Eric G. Wagner
- 1990
- Theoretical Computer Science
A theory of compaction-based parallelization
- Alexander Aiken
- 1990
- Theoretical Computer Science