Mathematics
Hardness
34%
NP-complete problem
28%
Inapproximability
26%
Graph in graph theory
24%
Monotone Boolean Function
22%
Hardness of Approximation
22%
Vertex Cover
21%
Prolog
20%
Lower bound
20%
Query Complexity
20%
Automata
20%
Query
19%
Tree Automata
19%
Influence
16%
Concurrent
16%
Multitype
16%
Lemma
16%
Random Graphs
14%
Set Packing
13%
Communication Complexity
12%
Communication
12%
Theorem
12%
Immunity
12%
Language
12%
Probabilistically Checkable Proofs
12%
Polynomial
11%
Community
11%
Approximation Problem
11%
Game
11%
Mergers
11%
Testing
10%
Extractor
10%
Zero-knowledge Proof
10%
Error Probability
10%
Reed-Muller Codes
10%
Parallel Implementation
9%
Fairness
9%
Vector Lattice
9%
Hash Function
9%
Isoperimetric
9%
Multivariate Functions
8%
Infectious Diseases
8%
Hashing
8%
Acute
8%
Steiner Tree
7%
Data Structures
7%
Market
7%
Monotone Function
7%
Framework
7%
Independent Set
7%
Engineering & Materials Science
NP-hard
100%
Polynomials
82%
Hardness
39%
Boolean functions
31%
Communication
19%
Testing
15%
Computer programming languages
13%
Logic programming
13%
Decoding
12%
Coloring
10%
Labels
9%
Computer science
9%
Formal languages
9%
Computational complexity
9%
Traveling salesman problem
9%
Parallel programming
8%
Hash functions
8%
Temporal logic
8%
Quadratic programming
8%
Finite automata
8%
Amplification
7%
Learning algorithms
7%
Merging
7%
Entropy
6%
Networks (circuits)
6%
Data structures
6%
Approximation algorithms
6%
Adaptive algorithms
5%
