原本說交大這邊不會有演講了，但是郭姐今天說明天還會有一場演講
請各位同學好好把握這次演講的機會，不然之後就要跑到清大囉!!
--------------------------------------------------------------------
題 目：Issues on computer search for large order multiple recursive
generators
主講人：鄧利源教授 (University of Memphis, USA)
時 間：100年12月16日(星期五)上午10:40-11:30
(上午10:20-10:40茶會於交大統計所429室舉行)
地 點：交大綜合一館427室
Abstract
Multiple Recursive Generators (MRGs) have become the most popular random
number generators recently. They compute the next value iteratively from the
previous k values using a k-th order recurrence equation which, in turn,
corresponds to a k-th degree primitive polynomial under a prime modulus p. In
general, when k and p are large, checking if a k-th degree polynomial is
primitive under a prime modulus p is known to be a hard problem. In this
talk, we discuss the major bottlenecks and recently proposed solutions for
the computer search for large order multiple recursive generators.
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 140.113.114.147
※ 編輯: locust0923 來自: 140.113.114.147 (12/15 14:21)