On the notion of infinite pseudorandom sequences
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3427210 (Why is no real title available?)
- scientific article; zbMATH DE number 3724342 (Why is no real title available?)
- scientific article; zbMATH DE number 3489016 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3339412 (Why is no real title available?)
- scientific article; zbMATH DE number 3420624 (Why is no real title available?)
- A Simple Unpredictable Pseudo-Random Number Generator
- A Theory of Program Size Formally Identical to Information Theory
- A variant of the Kolmogorov concept of complexity
- Complexity oscillations in infinite binary sequences
- General random sequences and learnable sequences
- How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
- Noncomplex sequences: characterizations and examples
- On the Length of Programs for Computing Finite Binary Sequences
- On the Length of Programs for Computing Finite Binary Sequences
- On the size of machines
- Process complexity and effective random tests
- Random Sets in Subrecursive Hierarchies
- THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
- The Literature on von Mises' Kollektivs Revisited
- The definition of random sequences
Cited in
(27)- Pseudorandom sources for BPP
- Some consequences of the existnce of pseudorandom generators
- Circuit size relative to pseudorandom oracles
- Kolmogorov complexity and nondeterminism versus determinism for polynomial time computations
- Almost everywhere high nonuniform complexity
- On the possibility of basing cryptography on \(\mathsf{EXP}\ne \mathsf{BPP} \)
- On resource-bounded instance complexity
- Compressibility and uniform complexity
- Subcomputable Schnorr randomness
- Indistinguishability obfuscation, range avoidance, and bounded arithmetic
- NP-hardness of approximating meta-complexity: a cryptographic approach
- On one-way functions and sparse languages
- One-way functions and the hardness of (probabilistic) time-bounded Kolmogorov complexity w.r.t. samplable distributions
- In Memoriam: Ker-I Ko (1950–2018)
- Sub-computable bounded pseudorandomness
- The structure of logarithmic advice complexity classes
- Resource bounded randomness and computational complexity
- On unstable and unoptimal prediction
- Symmetry of information and one-way functions
- Ker-I Ko and the Study of Resource-Bounded Kolmogorov Complexity
- An upward measure separation theorem
- On characterizations of the class PSPACE/poly
- Random languages for nonuniform complexity classes
- Closure of resource-bounded randomness notions under polynomial-time permutations
- A direct PRF construction from Kolmogorov complexity
- Vaughan Jones, Kolmogorov Complexity, and the New Complexity Landscape around Circuit Minimization
- Calibrating Randomness
This page was built for publication: On the notion of infinite pseudorandom sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1091817)
