Keyphrases
Polynomial Time
91%
Counting Complexity
83%
Exponential Time
66%
Complexity Dichotomy
66%
Homomorphism
52%
#P-hardness
44%
Tight Lower Bound
44%
Linear Combination
44%
K-matching
41%
Graph Classes
40%
Fixed Parameter
33%
Splittable
33%
Modular Counting
33%
#BIS
33%
Graph Homomorphism
33%
Time Complexity
33%
Immanants
33%
CI-graph
33%
Tight
33%
Injective Homomorphisms
33%
Graph Matching
33%
Streaming Algorithms
33%
#ETH
33%
Pattern Graph
30%
NP-hard
25%
Graph Parameters
24%
Parameterized Complexity
23%
Subgraph Counting
23%
Streaming Model
22%
Exponential Time Hypothesis
22%
Counting Problems
19%
PI-line
16%
Number of Subgraphs
16%
Intermediate Complexity
16%
Counting Independent Sets
16%
Line Graph
16%
Odd number
16%
Graph Anomaly Detection
16%
Vertex Cover number
16%
Bipartite Graph
16%
Karl Marx
16%
K-path
16%
Time Algorithm
16%
Graph Pattern
16%
Number of Vertices
16%
Fixed Pattern
13%
Induced Subgraph
13%
Dyers
11%
Homomorphism numbers
11%
Sweeping
11%
Mathematics
Homomorphism
100%
Polynomial Time
76%
Exponential Time
66%
Edge
56%
Integer
54%
Polynomial
50%
Independent Set
40%
Computable Function
33%
Kernelization
33%
Key Difference
33%
Linear Combination
33%
Approximates
25%
Counting Problem
25%
Running Time
16%
Induced Subgraph
13%
Bipartite Graph
11%
Analogous Result
8%
Young Diagram
8%
Irreducible Character
8%
Concludes
8%
Matrix (Mathematics)
8%
Open Question
6%
Maximum Degree
6%
