Fast parallel polynomial irreducibility
β Kaltofen.
π Library
π English
β¦ LIBER β¦
π
Parallel computation of polynomial GCDs 1989
β Scribed by Kaltofen.
- Tongue
- English
- Leaves
- 9
- Category
- Library
β¬ Acquire This Volume
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Computing GCDs of polynomials using blac
β Diaz, Kaltofen.
π Library
π English
Polynomials & Polynomial Inequalities
β Borwein P., Erdelyi T.
π Library
π Springer
π English
Cinquante Ans de Polynomes - Fifty Years
β Michel Langevin, Michel Waldschmidt
π Library
π
1990
π Springer
π English
Communication Complexity and Parallel Co
β Juraj HromkoviΔ
π Library
π
1997
π Springer
π English
This book is devoted to the investigation of a special topic in theoretical computer science - communication complexity as an abstract measure of the complexity of computing problems. Its main aim is to show how the theoretical study of communication complexity can be useful in the process of design
Communication Complexity and Parallel Co
β Juraj HromkoviΔ
π Library
π
1997
π Springer
π English
<p>The communication complexity of two-party protocols is an only 15 years old complexity measure, but it is already considered to be one of the fundamenΒ tal complexity measures of recent complexity theory. Similarly to Kolmogorov complexity in the theory of sequential computations, communication c