Mathematics
Approximates
100%
Polynomial Time
69%
Polynomial
43%
Hypergraphs
38%
Independent Set
35%
Integer
32%
Probability Theory
25%
Probabilistically checkable proofs
21%
Long Code
20%
Constant Factor
20%
Clique
19%
Grassmann
19%
Approximability
18%
Fourier Analysis
16%
Finite Field
15%
Boolean Function
14%
Colorable Graph
14%
Bipartite Graph
14%
Decision Tree
14%
Lattices
14%
Positive Semidefinite Matrix
14%
Inequality Constraint
14%
Gaussian Distribution
12%
Homogeneous Linear Equation
12%
Grothendieck
12%
Random Assignment
11%
Rounding
10%
Edge
10%
Max-Cut
9%
Linear Equation
9%
Identitymatrix
9%
Abelian Group
9%
Algebraic Curve
9%
Robust Analog
9%
Noisy Data
9%
Tensor
9%
Triangle Inequality
9%
Nearest Neighbor
9%
Planarity
9%
Utility Function
9%
Hypercube
9%
Clustering Algorithm
9%
Black Box
7%
Threshold Function
7%
Matrix (Mathematics)
7%
Combinatorics
7%
Open Problem
7%
Modulo
6%
Nonuniform
6%
Monotone Function
6%
Keyphrases
Unique Games Conjecture
30%
NP-hard
29%
Vertex Cover
20%
Closest Vector Problem
20%
Grassmann Graph
20%
NP-hardness
18%
Probabilistically Checkable Proofs
15%
Shortest Vector Problem
14%
Minimum Code Distance
14%
Inapproximability Results
14%
Uniform Hypergraph
13%
Hardness Results
13%
Verifier
13%
Polynomial-time Algorithm
12%
Perfect Completeness
12%
Fourier Analysis
12%
Label Cover
11%
Hardness of Approximation
11%
Linear Equations
9%
Polynomial Time
9%
Graph Complexes
9%
Boolean
9%
Randomized Complexity
9%
Min-bisection
9%
Dense Subgraphs
9%
Approximate Kernel
9%
Half-space
9%
Positive Integer
9%
Metric Labeling
9%
Earth Mover's Distance
9%
0-Extension
9%
Isoperimetric
9%
Monotonicity Test
9%
Nearest Codeword Problem
9%
Hardness of Learning
9%
Evasiveness
9%
Combinatorial Auctions
9%
Approximation Resistance
9%
Complexity Lower Bounds
8%
P-norm
8%
Log-log
8%
MaxSAT
8%
Integrality Ratio
8%
Monotone
8%
Hypergraph
7%
Polynomial-time Approximation Algorithm
7%
Discrete Fourier Analysis
7%
2-colorable
7%
Unique Games
7%
Randomized Reductions
7%
Computer Science
Approximation (Algorithm)
30%
Polynomial Time
20%
Bipartite Graph
14%
Approximation Algorithms
12%
Proof System
12%
Subgraphs
12%
Decision Trees
11%
Triangle Inequality
11%
Inequality Constraint
11%
Constant Factor
10%
Satisfying Assignment
10%
Semidefinite Programming
9%
Independent Set
9%
Relative Distance
9%
Soundness
9%
Acceptance Probability
9%
Communication Complexity
9%
Preprocessing
9%
Linear Equation
9%
Partial Match Problem
9%
Combinatorial Auction
9%
approximation factor
7%
Degree Polynomial
6%
Constraint Satisfaction Problems
6%
Random Assignment
6%
