Improvements on the star discrepancy of (t,s)-sequences
Henri Faure, Christiane Lemieux (2012)
Acta Arithmetica
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Henri Faure, Christiane Lemieux (2012)
Acta Arithmetica
Similarity:
Hans Carstens (1975)
Fundamenta Mathematicae
Similarity:
Harald Niederreiter (2009)
Acta Arithmetica
Similarity:
(2012)
Acta Arithmetica
Similarity:
Křížek, Michal, Šolcová, Alena, Somer, Lawrence
Similarity:
Hiroyuki Okazaki (2015)
Formalized Mathematics
Similarity:
In this article we formalize negligible functions that play an essential role in cryptology [10], [2]. Generally, a cryptosystem is secure if the probability of succeeding any attacks against the cryptosystem is negligible. First, we formalize the algebra of polynomially bounded sequences [20]. Next, we formalize negligible functions and prove the set of negligible functions is a subset of the algebra of polynomially bounded sequences. Moreover, we then introduce equivalence relation...
C. Zaremba (1963)
Applicationes Mathematicae
Similarity:
D. F. Dawson (1969)
Matematički Vesnik
Similarity:
Jovan D. Kečkić (1973)
Publications de l'Institut Mathématique
Similarity:
Mercer, A.McD. (1978)
International Journal of Mathematics and Mathematical Sciences
Similarity:
David Boyd (1979)
Acta Arithmetica
Similarity:
Lenny Jones (2012)
Acta Arithmetica
Similarity: