Mathematics
Polynomial
100%
Finite Field
80%
Affine Subspace
39%
Matrix (Mathematics)
32%
Error Correcting Codes
29%
Random Source
29%
Dimensional Subspace
29%
Constant Factor
29%
Modulo
26%
Random Variable
25%
Query Complexity
24%
Main Result
23%
Rigidity Matrix
22%
Design Matrix
22%
Combinatorial Geometry
22%
Inner Product
21%
Open Problem
20%
Complex Space
19%
Hypersurfaces
19%
Base Change
19%
Type Method
19%
Fourier Matrix
19%
Random Graph
19%
Bootstrapping
19%
Clustering
19%
Application Area
19%
Coding Theory
19%
Projection Method
19%
Network Theory
19%
Expander
17%
Combinatorics
16%
Condenser
16%
Generating Matrix
16%
Dot Product
14%
Decoding Procedure
14%
Collinear
14%
Approximates
14%
Linear Map
14%
Arithmetic
14%
Incidence Geometry
13%
Low Degree
13%
Linear Function
13%
Black Box
13%
Unit Vector
13%
Rigidity
11%
Probability Theory
11%
Square Modulo
9%
Defining Equation
9%
Smooth Function
9%
Finite Set
9%
Geometric Theorem
9%
Function Implies
9%
Furstenberg
9%
Laws of Large Number
9%
Codeword Length
9%
Additive Number Theory
9%
Symmetric Difference
9%
Linear Hashing
9%
Hash Function
9%
Interpolating Set
9%
Complex Number
9%
Dimension Dim
9%
Higher Dimensions
9%
Dimensional Space
9%
Data Structure
9%
Disjoint Set
9%
Exponential Sums
9%
Convex Geometry
9%
Circulant Matrix
9%
Local Information
9%
Cayley Graph
9%
Lattices
9%
Linear Algebra
9%
Linear Space
7%
Collinear Point
6%
Polynomial Time
5%
Keyphrases
Locally Decodable Codes
59%
Locally Correctable Codes
31%
Kakeya Set
29%
Min-entropy
29%
Extractor
26%
Entropy Rate
22%
Affine Subspaces
21%
Finite Fields
21%
Span Structure
19%
Ordinary Lines
19%
Outlaw
19%
Matching Vector Families
19%
Dimension Expanders
19%
Sylvester-Gallai
19%
Depth-3 Circuits
19%
Combinatorial Clustering
16%
Generator Matrix
16%
Block Size
14%
Random Source
13%
Polynomial Identity Testing
12%
Collinear Points
9%
Method of multiplicities
9%
Superquadratic
9%
Locally Decodable
9%
Branching Formulas
9%
Ring of Integers
9%
Sauer-Shelah Lemma
9%
Symmetric Difference Operator
9%
Polynomial Source
9%
Interpolation Algorithm
9%
Affine Extractors
9%
Collinear Triples
9%
Dimensional Expansion
9%
Expansion Property
9%
Integers Modulo
9%
Theoretical Extension
9%
Quantitative Versions
9%
Complex Space
9%
Square-free
9%
Furstenberg Sets
9%
Data Structure Lower Bounds
9%
Affine Variety
9%
Evasive Set
9%
Largest Subset
9%
Matrix Rigidity
9%
Bounded Depth
9%
Private Information Retrieval
9%
Cayley Graph
9%
Pairs of Subspaces
9%
Computational Complexity
9%
Incidence Geometry
8%
Polynomial Interpolation
8%
Geometric Clustering
8%
Clustering Structure
8%
Linear Function
8%
Random Graph Process
8%
Matching Vector Codes
8%
Input Source
8%
Non-rigidity
7%
Sylvester-Gallai Theorem
6%
Multiplicity of Zeros
6%
Condenser
6%
T-design
6%
Query Complexity
6%
Explicit Constructions
6%
Retrieval Scheme
6%
Randomness Extractors
6%
Arithmetic Circuits
6%
Unit Vector
6%
Bilinear Groups
6%
Disjoint
6%
Characteristic Zero
6%
Algebraic Branching Programs
5%
Subexponential
5%
Inner Product
5%
