Mathematics
Running Time
100%
Polynomial
71%
Edge
42%
Polynomial Time
40%
Worst Case
37%
Linear Time
34%
Clique-width
30%
Upper Bound
26%
Eigenvalue
25%
Independent Set
25%
Characteristic Polynomial
25%
Hamiltonian Cycle
25%
Perfect Matching
25%
Fast Algorithm
23%
Bipartite Graph
20%
Constant Factor
20%
Open Problem
18%
Computable Function
16%
Exponential Time
16%
Maximum Independent Set
16%
Leading Term
16%
Galois Field
16%
Sparse Graphs
16%
Matrix (Mathematics)
16%
Probability Theory
16%
Turing Machine
12%
Data Structure
12%
Diagonalmatrix
11%
Approximates
10%
NP-hard Problem
9%
Coin Toss
9%
Primality Testing
8%
Numerics
8%
Dominating Set
8%
Linear Function
8%
Partitioning Problem
8%
Spectral Invariant
8%
Tree Problem
8%
Truth Table
8%
Discrete Fourier Transform
8%
Natural Generalization
8%
Linear Dependence
8%
Direct Consequence
8%
Solution Space
8%
Set Packing
8%
Spanning Tree
8%
Complexity Space
8%
Adjacency Matrix
8%
Keyphrases
Treewidth
61%
Approximation Algorithms
52%
Polynomial Time
33%
Tree Decomposition
31%
Bounded Treewidth
24%
Random Graphs
20%
Polynomial Space
18%
Colour Classes
16%
Threshold Graph
16%
Maximum Independent Set
16%
Steiner Tree
16%
Communication Complexity
16%
Algebraization
16%
2-approximation
16%
Directed Graph
16%
Efficient Computation
16%
Exponential Time
16%
Counting Algorithm
16%
Characteristic Polynomial
16%
2-SAT
16%
Reed
16%
Fully Polynomial Time Approximation Scheme
16%
Diagonalization
16%
Symmetric Matrices
16%
Matrix-based
16%
Clique-width
15%
Las Vegas
15%
Approximation Ratio
14%
Fast Algorithm
13%
Bounded Degree Graphs
12%
Distance Query
12%
Sparse Graphs
12%
Almost All Graphs
12%
Counting Perfect Matchings
12%
Separator
12%
Graph Isomorphism
12%
Bipartite Graph
12%
Planar Graph
12%
Vertex Set
12%
Set Cover
11%
Linear Time
11%
Polynomial-time Approximation Algorithm
11%
Eigenvalues
11%
Dynamic Programming Algorithm
11%
Diagonal Matrix
11%
Time Algorithm
10%
Graph Decomposition
10%
Disk Graph
10%
Set Covering Problem
10%
Treedepth
10%
Computer Science
Independent Set
27%
Turing Machine
20%
Polynomial Time
17%
Planar Graph
16%
Tree Decomposition
16%
Communication Complexity
16%
Data Structure
16%
Efficient Computation
16%
Hamiltonian Cycle
16%
Characteristic Polynomial
16%
Polynomial Space
15%
Approximation (Algorithm)
13%
Approximation Algorithms
12%
Efficient Algorithm
11%
Random Access
9%
Maximal Matching
8%
Parallel Algorithm
8%
Local Optimization
8%
Predicate Calculus
8%
Complexity Measure
8%
Intersection Graph
8%
Conjunctive Normal Form
8%
Truth Table
8%
Regular Expression
8%
Universal Hashing
8%
Boolean Circuit
8%
Restrictive Condition
8%
Packing Problem
8%
Direct Consequence
8%
Directed Graphs
8%
Quantum Search
8%
Constant Factor
8%
steiner tree
8%
Invariant
8%
Random Graphs
8%
Fast Algorithm
8%
Boolean Formula
8%
Outdegree
6%
Truth Assignment
5%
Adjacent Vertex
5%
