Pages that link to "Item:Q1204523"
From MaRDI portal
The following pages link to Pseudorandom generators for space-bounded computation (Q1204523):
Displaying 50 items.
- Pseudorandom generators for combinatorial checkerboards (Q395607) (← links)
- Weak derandomization of weak algorithms: explicit versions of Yao's lemma (Q451107) (← links)
- Randomness buys depth for approximate counting (Q483707) (← links)
- Deterministic parallel algorithms for bilinear objective functions (Q666681) (← links)
- Improved hardness amplification in NP (Q868960) (← links)
- Impact of memory size on graph exploration capability (Q947116) (← links)
- Synthesizers and their application to the parallel construction of pseudo-random functions (Q1288205) (← links)
- \(\text{BP}_{\text{H}}\text{SPACE}(S) \subseteq \text{DSPACE}(S^{3/2})\) (Q1288206) (← links)
- Randomness in interactive proofs (Q1321030) (← links)
- \(\text{RL}\subseteq \text{SC}\) (Q1327590) (← links)
- Efficient construction of a small hitting set for combinatorial rectangles in high dimension (Q1382408) (← links)
- (De)randomized construction of small sample spaces in \(\mathcal{NC}\) (Q1384529) (← links)
- Log-space constructible universal traversal sequences for cycles of length O(\(n^{4.03}\)). (Q1401264) (← links)
- Provable time-memory trade-offs: symmetric cryptography against memory-bounded adversaries (Q1629393) (← links)
- Universal traversal sequences with backtracking. (Q1872734) (← links)
- How strong is Nisan's pseudo-random generator? (Q1944139) (← links)
- Explicit list-decodable codes with optimal rate for computationally bounded channels (Q2029777) (← links)
- Tight time-space lower bounds for finding multiple collision pairs and their applications (Q2055617) (← links)
- On the streaming indistinguishability of a random permutation and a random function (Q2119020) (← links)
- Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification (Q2232597) (← links)
- Pseudo-random graphs and bit probe schemes with one-sided error (Q2254500) (← links)
- Counting distinct items over update streams (Q2371800) (← links)
- Derandomized constructions of \(k\)-wise (almost) independent permutations (Q2391191) (← links)
- On approximating the eigenvalues of stochastic matrices in probabilistic logspace (Q2410679) (← links)
- Pseudorandom generators from regular one-way functions: new constructions with improved parameters (Q2513673) (← links)
- Graph exploration by a finite automaton (Q2575752) (← links)
- Quantum vs. classical algorithms for solving the heat equation (Q2676448) (← links)
- Quantum key distribution with PRF(Hash, Nonce) achieves everlasting security (Q2690521) (← links)
- Complexity theory. Abstracts from the workshop held November 14--20, 2021 (hybrid meeting) (Q2693051) (← links)
- Limitations of the Impagliazzo-Nisan-Wigderson pseudorandom generator against permutation branching programs (Q2695266) (← links)
- A New Pseudorandom Generator from Collision-Resistant Hash Functions (Q2890004) (← links)
- A Sufficient Condition for Sets Hitting the Class of Read-Once Branching Programs of Width 3 (Q2891385) (← links)
- A Statistical Analysis of Probabilistic Counting Algorithms (Q2911701) (← links)
- On Probabilistic Space-Bounded Machines with Multiple Access to Random Tape (Q2946415) (← links)
- Single Pass Spectral Sparsification in Dynamic Streams (Q2968162) (← links)
- Massive online teaching to bounded learners (Q2986853) (← links)
- Learning mixtures of spherical gaussians (Q2986854) (← links)
- Low-weight halfspaces for sparse boolean vectors (Q2986855) (← links)
- Learnability of DNF with representation-specific queries (Q2986856) (← links)
- Can theories be tested? (Q2986857) (← links)
- Making evolution rigorous (Q2986858) (← links)
- On the convergence of the Hegselmann-Krause system (Q2986859) (← links)
- Is privacy compatible with truthfulness? (Q2986860) (← links)
- Differentially private data analysis of social networks via restricted sensitivity (Q2986861) (← links)
- Characterizing the sample complexity of private learners (Q2986862) (← links)
- Barriers in cryptography with weak, correlated and leaky sources (Q2986863) (← links)
- On the possibilities and limitations of pseudodeterministic algorithms (Q2986864) (← links)
- Evasiveness through a circuit lens (Q2986865) (← links)
- The garden-hose model (Q2986866) (← links)
- Space-bounded communication complexity (Q2986867) (← links)
