Generating random elements of abelian groups
Copyright policy )Generating random elements of abelian groups
AbstractAlgorithms based on rapidly mixing Markov chains are discussed to produce nearly uniformly distributed random elements in abelian groups of finite order. Let A be an abelian group generated by set S. Then one can generate ϵ‐nearly uniform random elements of A using 4|S|log(|A|/ϵ) log(|A|) additions and the same number of random bits. © 2005 Wiley Periodicals, Inc. Random Struct. Alg., 2005
Finite abelian groups, Combinatorial probability, Probabilistic methods in group theory, finite Abelian groups, Symbolic computation and algebraic computation, algorithms, rapidly mixing Markov chains, nearly uniformly distributed random elements
Finite abelian groups, Combinatorial probability, Probabilistic methods in group theory, finite Abelian groups, Symbolic computation and algebraic computation, algorithms, rapidly mixing Markov chains, nearly uniformly distributed random elements
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).1 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!