منابع مشابه
Sparse Pseudorandom Distributions
The existence of sparse pseudorandom distributions is proved. These are probability distributions concentrated in a very small set of strings, yet it is infeasible for any polynomial-time algorithm to distinguish between truly random coins and coins selected according to these distributions. It is shown that such distributions can be generated by (nonpolynomial) probabilistic algorithms, while ...
متن کاملSparse and Evasive Pseudorandom Distributions
Pseudorandom distributions on n -bit strings are ones which cannot be efficiently distinguished from the uniform distribution on strings of the same length. Namely, the expected behavior of any polynomial-time algorithm on a pseudorandom input is (almost) the same as on a random (Le. unifo~y chosen) input. Clearly, the uniform distribution is a pseudorandom one. But do such trivial cases exhaus...
متن کاملSparse Pseudorandom Objects
It has been known for a long time that many mathematical objects can be naturally decomposed into a ‘pseudorandom’, chaotic part and/or a highly organized ‘periodic’ component. Theorems or heuristics of this type have been used in combinatorics, harmonic analysis, dynamical systems and other parts of mathematics for many years, but a number of results related to such ‘structural’ theorems emerg...
متن کاملExtremal Results in Sparse Pseudorandom Graphs Jacob
3-Connected Minor Minimal Non-Projective Planar Graphs with an Internal 3-Separation Arash Asadi, Georgia Institute of Technology The property that a graph has an embedding in the projective plane is closed under taking minors. So by the well known theorem of Robertson and Seymour, there exists a finite list of minor-minimal graphs, call it L, such that a given graph G is projective planar if a...
متن کاملExtremal results in sparse pseudorandom graphs
Szemerédi’s regularity lemma is a fundamental tool in extremal combinatorics. However, the original version is only helpful in studying dense graphs. In the 1990s, Kohayakawa and Rödl proved an analogue of Szemerédi’s regularity lemma for sparse graphs as part of a general program toward extending extremal results to sparse graphs. Many of the key applications of Szemerédi’s regularity lemma us...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Random Structures & Algorithms
سال: 1992
ISSN: 1042-9832
DOI: 10.1002/rsa.3240030206