Mathematics
Hardness
50%
Inapproximability
36%
Game
24%
Vertex Cover
15%
NP-complete problem
15%
Approximation Algorithms
14%
Polynomial-time Algorithm
12%
Probabilistically Checkable Proofs
11%
Subgraph
11%
Uniform Hypergraph
11%
Graph in graph theory
11%
Lower bound
10%
Fourier Analysis
9%
Assignment
9%
Approximation
9%
Graph Packing
9%
Query
9%
Hypergraph
8%
Combinatorial Auctions
8%
Utility Function
8%
Integrality
8%
Metric
7%
Positive Semidefinite Matrix
7%
Independent Set
7%
Hereditary Properties
7%
Welfare
7%
Clustering Algorithm
7%
Submodular Function
7%
NP-hardness
7%
Hardness of Approximation
7%
Maximise
7%
Preprocessing
6%
Bisection
6%
Metric space
6%
Clique
6%
Parameterized Complexity
6%
Monotone
6%
Semidefinite Programming
6%
Sketching
6%
kernel
5%
Computational Complexity
5%
Completeness
5%
Norm
5%
Clustering
5%
Imply
5%
Polynomial
5%
Characterization
5%
Engineering & Materials Science
Hardness
100%
NP-hard
60%
Polynomials
47%
Approximation algorithms
34%
Linear equations
19%
Constraint satisfaction problems
19%
Relaxation
19%
Coloring
18%
Labels
10%
Color
10%
Fourier analysis
9%
Decision trees
7%
Curve fitting
6%
Boolean functions
6%
Labeling
5%
Testing
5%
Clustering algorithms
5%