A Fast Jump Ahead Algorithm for Linear Recurrences in a Polynomial Space ? Hiroshi Haramoto1 , Makoto Matsumoto1 , and Pierre L’Ecuyer2 1 Dept. of Math., Hiroshima University, Hiroshima[removed]JAPAN,

First Page		Document Content
Date: 2010-03-31 02:27:40 Algebra Mersenne twister Linear feedback shift register Time complexity Matrix multiplication Horner scheme Linear algebra Theoretical computer science Mathematics Pseudorandom number generators		A Fast Jump Ahead Algorithm for Linear Recurrences in a Polynomial Space ? Hiroshi Haramoto1 , Makoto Matsumoto1 , and Pierre L’Ecuyer2 1 Dept. of Math., Hiroshima University, Hiroshima[removed]JAPAN, Add to Reading List Source URL: www.math.sci.hiroshima-u.ac.jp Download Document from Source Website File Size: 165,37 KB Share Document on Facebook

	COSC 544 Probabilistic Proof SystemsAn Optimal Interactive Proof for Matrix Multiplication Lecturer: Justin Thaler DocID: 1xUI5 - View Document
	Optimization Techniques for Small Matrix Multiplication ´ Charles-Eric Drevet ´ DocID: 1vrNt - View Document
	2018 IEEE International Symposium on High Performance Computer Architecture OuterSPACE: An Outer Product based Sparse Matrix Multiplication Accelerator Subhankar Pal∗ Jonathan Beaumont∗ Dong-Hyeon Park∗ Aporva Ama DocID: 1uUeI - View Document
	0 Autotuning Runtime Specialization for Sparse Matrix-Vector Multiplication BUSE YILMAZ, Ozyegin University BARIS ¸ AKTEMUR, Ozyegin University DocID: 1uMPm - View Document
	Recommended Reading Efficient Parallel Sparse Matrix–Vector Multiplication Using Graph and Hypergraph Partitioning U.V. C DocID: 1uzWI - View Document