Computing Powers in Parallel
Copyright policy )Computing Powers in Parallel
Fundamental discussion of fast parallel computation of a b mod m, for n- bit integers a,b,m, in time (log n)\({}^{O(1)}\), and of related questions, including arithmetic and boolean circuits, extension to polynomials.
- University of Toronto Canada
parallel processing, powers of integers and polynoials, arithmetic circuits, algebraic computing, Analysis of algorithms and problem complexity, boolean circuits, Symbolic computation and algebraic computation, parallel computation, Radix representation; digital problems, Polynomials over finite fields
parallel processing, powers of integers and polynoials, arithmetic circuits, algebraic computing, Analysis of algorithms and problem complexity, boolean circuits, Symbolic computation and algebraic computation, parallel computation, Radix representation; digital problems, Polynomials over finite fields
citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).20 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Top 10%
Citations provided by BIP!Popularity provided by BIP!