… In summary, the extra smoothness introduced by the existence of finite variation makes
multivariate integration a tractable problem, since with a good choice of n deterministic points the …

In our recent work (Bubeck, Price, Razenshteyn, arXiv:1805.10204) we argued that adversarial
examples in machine learning might be due to an inherent computational hardness of …

… The results derived are valid for all t-functions regardless the type of construction and indicate
the existence of nonrandomness. As the problem of the efficient implementation of secure s…

… needed to generate a vector of random variables from a stable distribution, we use
pseudorandom generators for bounded … Show that there exists a threshold T = T(k,γ,ϵ), such that: …

… ABSTRACT: Three types of computer-based pseudorandom number generators have been
… arithmetic calculations on pseudorandom number generation, the existence of higher order …

… In Section 4 we discuss the link that exists between the dynamics of chaotic and pseudo-…
initial seed of the generator, and we define a congruential generator as an iterative method …

… Alternative constructions that are far more efficient exist when assuming the one-way
function is of a certain restricted structure (eg a permutations or a regular function). Recently, …

… In such a case we require the existence of a representation length ℓ n , m = poly ( n , m )
such that H n , m contains 2 ℓ n , m (not necessarily distinct) functions h i indexed by all binary …

… existence of predicates with high circuit complexity to the existence of good pseudo-random
generators. … assumptions, eg, the existence of one-way functions): the predicate used by the …