Results 251 to 260 of about 117,653 (287)
Amplifying the Randomness of Weak Sources Correlated With Devices [PDF]
IEEE Transactions on Information Theory, 2017 38 pages, 10 ...
Fernando G S L Brandao +2 more
exaly +4 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Computing with very weak random sources
Proceedings 35th Annual Symposium on Foundations of Computer Science, 1999Summary: We give an efficient algorithm to extract randomness from a very weak random source using a small additional number \(t\) of truly random bits. Our work extends that of \textit{N. Nisan} and \textit{D. Zuckerman} [J. Comput. Syst. Sci. 52, No.
Srinivasan, A., Zuckerman, D.
openaire +1 more source
Weak quasi‐randomness for uniform hypergraphs
Random Structures & Algorithms, 2011AbstractWe study quasi‐random properties of k‐uniform hypergraphs. Our central notion is uniform edge distribution with respect to large vertex sets. We will find several equivalent characterisations of this property and our work can be viewed as an extension of the well known Chung‐Graham‐Wilson theorem for quasi‐random graphs.Moreover, let Kk be the ...
David Conlon +3 more
openaire +2 more sources
On the weak chromatic number of random hypergraphs
Discrete Applied Mathematics, 2020zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Alexander Semenov, Dmitry A. Shabanov
openaire +2 more sources
Extractors with weak random seeds
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing, 2005We show how to extract random bits from two or more independent weak random sources in cases where only one source is of linear min-entropy and all other sources are of logarithmic min-entropy. Our main results are as follows: A long line of research, starting by Nisan and Zuckerman[14], gives explicit constructions of seeded-extractors, that is ...
openaire +2 more sources
Ferromagnets with weak random anisotropy
Physical Review B, 1987We consider a continuous-symmetry ferromagnet for d=3 with random anisotropy which is weak compared to exchange (${H}_{r}$\ensuremath{\ll}${H}_{\mathrm{ex}}$), in the presence of an external field H. At low fields the system is macroscopically disordered (the Imry-Ma or correlated spin-glass regime), and the external field may be treated as a ...
openaire +2 more sources
On the Weaknesses of Function Table Randomization
2018Latest defenses against code-reuse attacks focus on information hiding and randomization as important building blocks. The main idea is that an attacker is not able to find the position of the code she wants to reuse, hence thwarting successful attacks.
Moritz Contag +3 more
openaire +1 more source
Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science, 2002
The following model for a weak random source is considered. The source is asked only once for R bits, and the source outputs an R-bit string such that no string has probability more than 2/sup - delta R/ of being output. for some fixed delta >0. A pseudorandom generator that runs in time n/sup O(log n)/ and simulates RP using as a seed a string from ...
openaire +1 more source
The following model for a weak random source is considered. The source is asked only once for R bits, and the source outputs an R-bit string such that no string has probability more than 2/sup - delta R/ of being output. for some fixed delta >0. A pseudorandom generator that runs in time n/sup O(log n)/ and simulates RP using as a seed a string from ...
openaire +1 more source
ω-Change Randomness and Weak Demuth Randomness.
J. Symb. Log., 2014Accepted ...
Franklin, Johanna N. Y., Ng, Keng Meng
openaire +2 more sources
2010
In this chapter, we introduce an important class of “randomnesstheoretically weak” sets, the K-trivial sets. As we will see, this class has several natural characterizations, can be used to answer several questions in the theory of algorithmic randomness, and is also of great interest to computability theory.
Rodney G. Downey, Denis R. Hirschfeldt
openaire +1 more source
In this chapter, we introduce an important class of “randomnesstheoretically weak” sets, the K-trivial sets. As we will see, this class has several natural characterizations, can be used to answer several questions in the theory of algorithmic randomness, and is also of great interest to computability theory.
Rodney G. Downey, Denis R. Hirschfeldt
openaire +1 more source