A Sublinear Time Randomized Algorithm for Coset Enumeration in the Black Boz Model

摘要：

Coset enumeration is for enumerating the cosets of a subgroup H of a finite index in a group G. We study coset enumeration algorithms by using two randoM sources to generate random elements in a finite group G and its subgroup H. For a finite set S and a real number c > 0, a random generator Rs is a c-random

作者: Bin Fu Zhixiang Chen

作者单位: Dept. of Computer Science,University of Texas - Pan American, TX 78539,USA Dept. of Computer Science,University of Texas - Pan American, TX 78539, USA

会议类型: 国际会议

会议名称: The 4th Annual International Computing and Combinatorics Conference,COCOON 2008(第14届国际计算和组合会议)

会议地点: 大连

会议语种:英文

页码: 82-91

在线出版日期: 2008-06-01（万方平台首次上网日期，不代表论文的发表时间）