scientific article
From MaRDI portal
Publication:3002801
DOI10.4086/toc.2009.v005a003zbMath1213.68274OpenAlexW2611668233MaRDI QIDQ3002801
Publication date: 24 May 2011
Published in: Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4086/toc.2009.v005a003
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Number-theoretic algorithms; complexity (11Y16) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items (15)
Quantified Derandomization: How to Find Water in the Ocean ⋮ Cryptographic hardness of random local functions. Survey ⋮ Unnamed Item ⋮ Pseudorandom generators for \(\mathrm{CC}^0[p\) and the Fourier spectrum of low-degree polynomials over finite fields] ⋮ Pseudorandom generators for combinatorial checkerboards ⋮ Paradigms for Unconditional Pseudorandom Generators ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Bounded Independence Plus Noise Fools Products ⋮ Unnamed Item ⋮ A Simple Deterministic Reduction for the Gap Minimum Distance of Code Problem ⋮ Unnamed Item ⋮ Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition ⋮ On hitting-set generators for polynomials that vanish rarely
This page was built for publication:
