Mathematics
Edge
100%
Clique
79%
Boolean Function
77%
Probability Theory
74%
Query Complexity
69%
Upper Bound
65%
Independent Set
62%
Polynomial Time
54%
Polynomial
50%
Approximates
49%
Combinatorial Lemma
42%
Complexity Space
40%
Main Result
37%
Set Point
34%
Graph Coloring
34%
Matrix (Mathematics)
34%
Open Problem
34%
Positive Integer
29%
Running Time
29%
Input Bit
27%
Generality
23%
Local Search
23%
Multiplicative Constant
23%
Crossing Number
23%
Real Polynomial
23%
Submatrix
23%
Resilient Function
23%
Clique in a Graph
23%
Asymptotic Property
23%
Finite Family
23%
Total Number
23%
Approximation Problem
23%
Line Graph
23%
Exp
23%
Turing Machine
23%
Integer
21%
Qubit
21%
degree sequence π
20%
Constant Factor
19%
Cardinality
17%
Fast Algorithm
15%
Linear Time
15%
Maximum Degree
12%
Sampling Scheme
11%
Performance Measure
11%
Physical System
11%
Winning Probability
11%
Arbitrary Dimension
11%
Random Sample
11%
Local Minimum
11%
Keyphrases
Communication Complexity
75%
Boolean Functions
61%
Query Complexity
48%
Qubit
44%
Randomized Algorithms
43%
Quantum Query Complexity
40%
Graph Coloring
40%
Semidefinite Programming
38%
NP-hard
37%
Local Lemma
37%
Quantum Adversary
34%
Dichotomy Theorem
34%
Streaming Algorithms
34%
Hardness of Approximation
34%
Boolean
34%
Quantum Algorithms
33%
Polynomial Time
31%
Number of Steps
30%
Adversary
29%
Probabilistically Checkable Proofs
29%
Number of Edges
27%
Streaming Model
27%
Large Graphs
27%
Tardos
26%
Undirected Graph
26%
Frequency Moments
24%
Thrackle
23%
Efficient Testing
23%
Delaunay Graph
23%
Powers of Two
23%
Grover's Algorithm
23%
Triangle Problem
23%
Probabilistic Verification
23%
Target Function
23%
Neighborhood Structure
23%
Bounded Communication
23%
Local Search
23%
Bounded Depth
23%
Threshold Circuits
23%
Classical Formula
23%
Axis-parallel Rectangles
23%
Formula Size
23%
Real Polynomial
23%
Resilience
23%
Graph Properties
23%
Crossing number
23%
Self-join
23%
Limited Storage Capacity
23%
Line Graph
23%
Proof Test
23%
Computer Science
Communication Complexity
81%
Polynomial Time
64%
Independent Set
38%
Directed Graphs
34%
Coloring Problem
34%
Quantum Algorithm
34%
Graph Coloring
34%
Qubit
33%
Signature Scheme
29%
Randomized Algorithm
27%
Parallel Computation
23%
Semidefinite Programming
23%
Neighborhood Structure
23%
Constraint Satisfaction Problems
23%
Approximation Problem
23%
Quantum Computing
20%
Maximal Clique
17%
Efficient Algorithm
17%
multiple robot
17%
Robotics
17%
Reconfiguration
15%
Regular Language
15%
Constant Factor
14%
Quantum Circuit
13%
Space Complexity
13%
Truth Table
11%
Winning Probability
11%
Tensor Network Contraction
11%
Mechanism Design
11%
Selection Strategy
11%
Maximally Entangled State
11%
Tensor Network
11%
Simulated Annealing
11%
Computation by Abstract Devices
11%
Dependency Graph
11%
Proof Checking
11%
Maximum Matching
11%
Learning Algorithm
11%
Connectivity Graph
11%
Fault Tolerant
11%
Distribution List
11%
Chordal Graph
11%
Parallelization
11%
robot path planning
11%
Bisection Width
11%
Sequential Version
11%
Parameter Value
11%
Graphic Hardware
11%
Subclasses
11%
Greedy Algorithm
11%
