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...
16 KB (2,750 words) - 14:25, 16 February 2024
Ramsey's theorem (category Theorems in graph theory)
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...
63 KB (7,928 words) - 18:56, 2 October 2024
analysis Online algorithm Polynomial time approximation scheme Problem size Pseudorandom number generator Quantum algorithm Random-restart hill climbing Randomized...
1 KB (125 words) - 13:50, 14 September 2024
In graph theory, an expander graph is a sparse graph that has strong connectivity properties, quantified using vertex, edge or spectral expansion. Expander...
38 KB (5,147 words) - 10:56, 25 June 2024
science, a pseudorandom generator for low-degree polynomials is an efficient procedure that maps a short truly random seed to a longer pseudorandom string...
4 KB (582 words) - 08:11, 14 July 2024
Edge coloring (category Graph coloring)
Ferber, Asaf; Jain, Vishesh (September 2020), "1-factorizations of pseudorandom graphs", Random Structures & Algorithms, 57 (2): 259–278, arXiv:1803.10361...
65 KB (8,472 words) - 14:53, 9 October 2024
Boost (C++ libraries) (redirect from Boost Graph Library)
that provides support for tasks and structures such as linear algebra, pseudorandom number generation, multithreading, image processing, regular expressions...
9 KB (777 words) - 01:01, 20 January 2024
Polynomial vector spaces, denoted by P n {\displaystyle \mathbb {P} _{n}} Pseudorandom number sequence Part number, an identifier of a particular part design...
3 KB (357 words) - 22:51, 26 September 2024
List of algorithms (redirect from Graph algorithms)
marriage problem[citation needed] Pseudorandom number generators (uniformly distributed—see also List of pseudorandom number generators for other PRNGs...
71 KB (7,827 words) - 18:40, 18 August 2024
Middle-square method (category Pseudorandom number generators)
computer science, the middle-square method is a method of generating pseudorandom numbers. In practice it is a highly flawed method for many practical...
6 KB (845 words) - 20:15, 18 August 2024