Keyphrases
Pseudorandom number Generator
90%
Seed Length
89%
Derandomization
89%
Pseudorandomness
69%
Min-entropy
69%
Log-space
61%
Two-source Extractors
60%
Two-source
55%
Randomized Algorithms
55%
Deterministic Algorithm
46%
Nearly Optimal
46%
Non-malleable Extractors
46%
Near-optimal
42%
Low Error
41%
Laplacian Solver
39%
Logarithmic Space
39%
Undirected Graph
39%
Log-log
37%
Spectral Sparsification
36%
Independence Sampling
36%
Hitting Set Generators
36%
Eigenvalues
36%
Bounded Independence
36%
Stochastic Matrix
36%
Small Space
36%
Efficient Reduction
36%
Extractor
36%
Read-once
34%
Polynomial Time
32%
Entropy Gap
31%
Condenser
31%
Expander
30%
Read-once Branching Programs
29%
Resilient Functions
28%
Logspace Algorithm
27%
Minimal Memory
27%
Memory Footprint
27%
Edge Sampling
24%
Sampling Algorithm
24%
Wmax
24%
DSPACE
24%
List Length
24%
Explicit Constructions
24%
Error Reduction
22%
High Probability
22%
Error Correction Codes
21%
Read-once Formulas
18%
Matrix Powering
18%
Iterated Matrix multiplication
18%
GV Bound
18%
Mathematics
Derandomization
100%
Polynomial
86%
Branching Programs
55%
Condenser
43%
Approximates
41%
Edge
40%
Stochastic Matrix
36%
Complexity Space
36%
Error Correcting Codes
36%
Hitting Set
36%
Resilient Function
36%
Laplace Operator
36%
Eigenvalue
36%
Probability Theory
36%
Matrix (Mathematics)
32%
Stochastics
32%
Running Time
25%
Counting Problem
18%
Weaker Assumption
18%
Linear Code
18%
Variable Order
18%
Random Walk
18%
Elementary Symmetric Polynomial
18%
Matrix Multiplication
18%
Expander
18%
Polynomial Time
13%
Main Result
12%
Hermitian Operator
10%
Probabilistic Algorithm
9%
Srivastava
9%
Data Structure
9%
Taylor Series
9%
Matrix Inversion
9%
Quantum Algorithm
9%
Turing Machine
9%
Black Box
9%
Weighted Undirected Graph
9%
Binary String
9%
Integer
9%
Monomials
9%
weighted graph
9%
Lower and upper bounds
9%
Binary Code
9%
Input Bit
6%
Nonlinear
6%
Random Variable
6%
Open Problem
6%
Shannon Entropy
6%
Algebraic Problem
6%
Permutation
6%
