Mathematics
Approximates
25%
Bipartite Graph
20%
Boolean Function
26%
Decision Tree
29%
Edge
63%
Graph Model
29%
Integer
20%
Main Result
31%
Matrix (Mathematics)
24%
Minimum Spanning Tree
45%
Multiplicative
23%
Planar Graph
30%
Polynomial
27%
Polynomial Time
30%
Probability Theory
25%
Property Testing
100%
Query Complexity
76%
simplicial complex σ
32%
Upper Bound
36%
Keyphrases
Boolean Functions
51%
Combinatorial Properties
29%
Decision Tree
34%
Dense Graphs
21%
Graph Embedding
22%
Graph Properties
38%
High Probability
21%
Minimum Spanning Tree
29%
Outerplanar Graph
36%
Property Testing
81%
Query Complexity
85%
Randomized Algorithms
24%
Regular Languages
26%
Routing Algorithm
20%
Simplicial Complex
32%
Stackelberg
22%
Tight
22%
Computer Science
Approximation (Algorithm)
27%
Approximation Algorithms
34%
Boolean Function
49%
Communication Complexity
28%
Decision Tree
41%
Minimum Spanning Tree
34%
Randomized Algorithm
31%
Regular Language
25%
Routing Algorithm
22%
