Keyphrases
Query Complexity
98%
Property Testing
79%
Testing Algorithm
62%
Sublinear Time
46%
Bounded Degree Graphs
42%
Dense Graphs
30%
Graph Properties
30%
Number of Vertices
28%
Sublinear Algorithms
27%
Number of Edges
26%
Sample Complexity
25%
Graph Model
25%
Neighbor Query
24%
One-sided Error
24%
Arboricity
22%
High Probability
22%
General Graphs
21%
Distance Parameter
20%
Bipartiteness
19%
Non-adaptive
19%
Oracle
18%
Distance Approximation
18%
Learning Algorithm
17%
Randomized Algorithms
17%
Maximum Degree
16%
Sparse Graphs
16%
Sampling Methods
16%
Class Function
15%
Tight
15%
Boolean Functions
15%
Subsequence
14%
Juntas
14%
Approximation Algorithms
14%
Bounded Degree
14%
Adjacency Matrix
14%
Directed Graph
14%
Uniform Distribution
13%
Query Model
13%
Local Algorithms
13%
Distribution-free
13%
Automata
13%
Monotone
12%
Monomial
12%
Degree Graph
12%
Bounded Arboricity
12%
Approximation Parameters
11%
Convexity
11%
Testing Problem
11%
Multiplicative Factors
10%
Colorability
10%
Mathematics
Query Complexity
100%
Property Testing
94%
Edge
75%
Probability Theory
58%
Polynomial Time
37%
Polynomial
35%
Upper Bound
27%
Running Time
23%
Matrix (Mathematics)
22%
Graph Model
22%
Boolean Function
21%
Arboricity
20%
Adjacency Matrix
20%
Uniform Distribution
17%
Approximates
16%
Subsequence
16%
Sparse Graphs
15%
Triangle
14%
Maximum Degree
14%
Clique
14%
Total Number
12%
Colorability
12%
Lower and upper bounds
11%
Testing Problem
11%
Main Result
10%
Multiplicative
10%
Testing Model
9%
Reed-Muller Code
9%
Random Walk
9%
Variance
8%
Planarity
8%
Degree Distribution
8%
Conditionals
8%
Clustering
8%
Binary Decision
8%
Integer
8%
Worst Case
8%
Cross-Validation
7%
Spanning Tree
6%
Monomials
6%
Constant Ratio
5%
Hexagon
5%
Distinct Element
5%
Bounded Number
5%
Monomial Function
5%
Domain Element
5%
Permutation
5%
Probability Distribution
5%
Run-Length Encoding
5%
Lossless Compression
5%
Computer Science
Approximation (Algorithm)
47%
Subgraphs
41%
Randomized Algorithm
24%
Approximation Algorithms
21%
Local Algorithm
18%
Efficient Algorithm
17%
Adjacency Matrix
17%
Polynomial Time
17%
Automaton
16%
Learning Algorithm
14%
Directed Graphs
14%
Constant Probability
13%
Cardinality
13%
Finite Automata
11%
Uniform Distribution
11%
Distributed Algorithm
11%
Case Study
8%
Dynamic Environment
8%
Preferential Attachment
8%
Planar Graph
8%
Subclasses
8%
Success Probability
8%
Random Walk
7%
Spanning Tree
6%
Testing Problem
6%
Boolean Function
6%
Polynomial Complexity
5%
Graph Coloring
5%
Cellular Network
5%
Coloring Problem
5%
Incorrect Answer
5%
Graph Partition
5%
Context Free Languages
5%
Degree Distribution
5%
Initial Configuration
5%
Unknown Function
5%
Compressibility
5%
Coding Theory
5%
Affine Subspace
5%
Autonomous System
5%
Case Complexity
5%
Computational Complexity
5%
Modified Version
5%
Approximation Ratio
5%
Disjoint Subset
5%
Adaptive Algorithm
5%
Deterministic Finite Automaton
5%
