In graph theory, a graph is said to be a pseudorandom graph if it obeys certain properties that random graphs obey with high probability. There is no concrete...

2013, Conlon, Fox and Zhao showed using a counting lemma for sparse pseudorandom graphs that rind(H) ≤ cn2Δ+8, where the exponent is best possible up to...

initialize a pseudorandom number generator. A pseudorandom number generator's number sequence is completely determined by the seed: thus, if a pseudorandom number...

Ferber, Asaf; Jain, Vishesh (September 2020), "1-factorizations of pseudorandom graphs", Random Structures & Algorithms, 57 (2): 259–278, arXiv:1803.10361...

In graph theory, an expander graph is a sparse graph that has strong connectivity properties, quantified using vertex, edge or spectral expansion. Expander...

Polynomial vector spaces, denoted by P n {\displaystyle \mathbb {P} _{n}} Pseudorandom number sequence Part number, an identifier of a particular part design...

ECCC TR16-124. Khot, Subhash; Minzer, Dor; Safra, Muli (2018). "Pseudorandom Sets in Grassmann Graph Have Near-Perfect Expansion". 2018 IEEE 59th Annual Symposium...

Below is a graph fragment of an example LDPC code using Forney's factor graph notation. In this graph, n variable nodes in the top of the graph are connected...

that provides support for tasks and structures such as linear algebra, pseudorandom number generation, multithreading, image processing, regular expressions...

computer science, the middle-square method is a method of generating pseudorandom numbers. In practice it is a highly flawed method for many practical...

science, a pseudorandom generator for low-degree polynomials is an efficient procedure that maps a short truly random seed to a longer pseudorandom string...

the creation of pseudorandom numbers using a computer is an important technique, and one of the methods for generating pseudorandom numbers is the use...

analysis Online algorithm Polynomial time approximation scheme Problem size Pseudorandom number generator Quantum algorithm Random-restart hill climbing Randomized...

hypergraphs and graph limits. In general, the theory of quasi-randomness gives a rigorous approach to 'random-like' or 'pseudorandom' alternatives. A...

solves the stable matching problem Pseudorandom number generators (uniformly distributed—see also List of pseudorandom number generators for other PRNGs...

Forcing graphs play an important role in the study of pseudorandomness in graph sequences. The forcing conjecture states that the forcing graphs are exactly...

In common practice, randomized algorithms are approximated using a pseudorandom number generator in place of a true source of random bits; such an implementation...

median of medians (a linear time selection algorithm), the Blum Blum Shub pseudorandom number generator, the Blum–Goldwasser cryptosystem, and more recently...

K , ϵ ) {\displaystyle (N,M,D,K,\epsilon )} -extractor is a bipartite graph with N {\displaystyle N} nodes on the left and M {\displaystyle M} nodes...

whether there exists a path between two vertices in a given undirected graph, is in L, showing that L = SL, since USTCON is SL-complete. One consequence...

operation which takes a large graph ( G {\displaystyle G} ) and a small graph ( H {\displaystyle H} ) and produces a graph that approximately inherits the...

analogues of the blow-up lemma for embedding bounded degree graphs into random and pseudorandom graphs Komlós, János; Sárközy, Gábor N.; Szemerédi, Endre (1997)...

computational complexity theory and cryptography. He focuses on the topics of pseudorandomness and zero-knowledge proofs. His work on the zig-zag product, with Omer...

S2CID 15794408 Khot, Subhash; Minzer, Dor; Safra, Muli (2018), "Pseudorandom Sets in Grassmann Graph Have Near-Perfect Expansion", 2018 IEEE 59th Annual Symposium...

Each participant then locally feeds this shared master secret into a pseudorandom number generator, in order to produce as many shared "coin flips" as...

Graham studied the mixing time of this process, motivated by the study of pseudorandom number generators.[A87] Graham became a capable juggler beginning at...

a rotation map is a function that represents an undirected edge-labeled graph, where each vertex enumerates its outgoing neighbors. Rotation maps were...

problem global optimum gnome sort goobi graph graph coloring graph concentration graph drawing graph isomorphism graph partition Gray code greatest common...

binary digits with pseudorandom properties The Mycielskian, a construction for embedding any undirected graph into a larger graph with strictly higher...

n {\displaystyle g(x)=(x^{2}+1){\bmod {n}}} ), is used to generate a pseudorandom sequence. It is important to note that g ( x ) {\displaystyle g(x)} must...