Sentence examples for multiplication graph from inspiring English sources

It has long been known that certain problems – e.g. matrix multiplication, graph reachability, and sorting – admit parallel algorithms which in some cases are faster than the most efficient known sequential ones (see, e.g., Papadimitriou 1994).

Gronau, M. Grüttmüller, S. Hartmann, U. Leck, V. Leck, On orthogonal double covers of graphs, Designs, Codes and Cryptography 27 (2002) 49 91] have observed that if A has the structure of a finite ring and if f∈A is such that both f+1 and f−1 are units, then the family, obtained by taking for G0 the multiplication graph of f and for Ga the rotation of G0 by a, defines an orthogonal cover on K.

Using simple arguments his lower bound of 2n/768−1 on the size of OBDDs representing the graph of integer multiplication is improved up to 2n/24.

Note that we do not consider the multiplications of 2 in the flow graph which are generated by the operations of Fig. 7 and 13 as multipliers, since these only involve 1-bit left shift.

We define a unique algorithm representation for solving problems such as matrix multiplication, transitive closure, finding critical path in a graph, finding all-pairs shortest paths in a graph, etc.

Yakira and her tutor, Kelly Zimmerman, have made a graph of her work on multiplication tables, which has steadily improved.

Further analysis of the dataflow graph shows dependency of the multiplication operators to the previous operations of bitand and subtraction.

(In this sense, concatenation in the graph E is interpreted as multiplication in K E or L K ( E ).) We denote by α ∗ the element e n ∗ ⋯ e 2 ∗ e 1 ∗ of L K ( E ).

Thus, for an N=2 n -point RFFT, when n≥2, there will be n−2 multiplications of (sqrt {2}) in the flow graph.

In a sense, the definition of a Leavitt path algebra treats the graph as a dynamical system: its multiplication is based on the ways one can traverse the vertices of the graph via the edges.

(For an element m in a left L K ( E ) -module M, and any left ideal I of L K ( E ), ρ m : I → M denotes right multiplication by m.) [14] Let E be any graph and K any field.