Keyphrases
NP-hard
100%
Automata
38%
Grassmann Graph
34%
Number of Bits
26%
Communication Complexity
26%
Total Influence
26%
NP-hardness
24%
Low-degree Testing
24%
Inapproximability Results
23%
Fourier
23%
Error Probability
21%
P-NP
21%
Hardness Results
21%
Inapproximability
20%
Hardness of Approximation
19%
Codeword
19%
Prover
19%
Determinization
18%
Juntas
17%
Vertex Cover
17%
Polynomial Time
16%
Complexity Results
16%
Query Complexity
16%
Non-adaptive
16%
Unique Games
15%
Pseudorandomness
15%
Hypergraph
15%
Boolean
15%
3-colorable Graphs
14%
New Characterization
14%
Monotone Boolean Functions
14%
Acceptance Conditions
13%
Group Steiner Tree
13%
One-round
13%
Tree Automata
13%
Complexity Lower Bounds
13%
Reed-Muller Codes
13%
Extractor
13%
Asymmetric Communication
13%
Minimum Vertex Cover Problem
13%
List Decoding
13%
Isoperimetric
13%
Hadamard Code
13%
Polynomial-time Algorithm
13%
Prolog
13%
Entropy Conjecture
13%
Exchange Equilibria
13%
Market Equilibrium
13%
Informational Economy
13%
Hard-Core Predicates
13%
Mathematics
Approximates
72%
Polynomial
45%
Grassmann
39%
Probability Theory
37%
Boolean Function
35%
Low Degree
27%
Independent Set
26%
Polynomial Time
26%
Constant Factor
19%
Colorable Graph
19%
Lattices
16%
Clique
16%
Query Complexity
16%
Induced Subgraph
13%
Error Correcting Codes
13%
Data Structure
13%
Edge
13%
Approximation Problem
13%
Reed-Muller Code
13%
Approximability
13%
Free Graph
13%
Hadamard Code
13%
Robust Analog
13%
Euclidean Plane
13%
Traveling Salesman Problem
13%
Asymmetric
13%
One-Way Function
13%
Entropy Conjecture
13%
Set Packing
13%
Quadratic Programming
13%
Monotone Function
13%
Random Walk
13%
Herd Immunity
13%
Random Graphs
13%
Reproduction Number
12%
Integer
11%
Branching Process
10%
VC Dimension
9%
Clique in a Graph
9%
Matrix (Mathematics)
8%
Linear Equation
6%
Derandomization
6%
Interactive Proofs
6%
Group tests
6%
Disjoint Set
6%
Probabilistically checkable proofs
6%
Hypergraphs
6%
Vector Lattice
6%
Square Root
6%
Maximum Independent Set
6%
Computer Science
Automaton
38%
Polynomial Time
32%
Independent Set
26%
Error Correcting Codes
21%
Communication Complexity
19%
Learning Algorithm
13%
Hashing
13%
Tree Automaton
13%
Strong Fairness
13%
Polynomial Degree
13%
Proof Technique
13%
Data Structure
13%
Computational Problem
13%
Case Complexity
13%
Programming Language
13%
Logic Programming
9%
Fourier Coefficient
8%
Computer Science
7%
Decision Problem
7%
Approximation (Algorithm)
6%
Satisfied Constraint
6%
Pipelining
6%
Programming Methodology
6%
Multiple Process
6%
Boolean Function
6%
approximation factor
6%
Embedding Distortion
6%
Assignment Variable
6%
Multiple Assignment
6%
Runtime Support
6%
Computational Complexity Theory
6%
Intriguing Connection
6%
Affine Subspace
6%
Data Type
6%
Soundness
6%
Dimensional Lattice
6%
Temporal Logic
6%
Minimum Distortion
6%
Programming Technique
6%
Parallel System
6%
Programming Environment
6%
polynomial-time algorithm
6%
Heuristic Algorithm
6%
Simple Algorithm
6%
Optimizing Compiler
6%
Parallel Implementation
6%
Knowledge Proof
6%
Problem Instance
6%
Diagonal Element
6%
Colorable Graph
6%
