Running Time:
2 3 4
0 1 3
0 2 5
1 0 9
1 2 8
0 1 2 row_terms[MAX_COL]
1 1 2
0 1 2 3 starting_pos[MAX_COL] //initial state
1 2 3 5
0 1 2 3 starting_pos[MAX_COL] //initial state
2 3 3 5
Transpose
3 2 4
0 1 9
1 0 3
2 0 5
2 1 8
Running Time:
SPARSE MATRIX MULTIPLICATION
Running Time is
Classical algorithm Running Time is
EASIER WAY
NOT IN TEXTBOOK
SPARSE MATRIX MULTIPLICATION
ADDITION OF POLYNOMIAL
Coef
2 1 10 3 2
Exp 1000 4 3 2 0