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...

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

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

marriage problem[citation needed] Pseudorandom number generators (uniformly distributed—see also List of pseudorandom number generators for other PRNGs...

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

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

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

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

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