Keyphrases
Algebraic Circuits
20%
Bounded Degree
20%
Chromatic number
33%
CNF Formulas
20%
Commutativity
13%
Connected Subgraphs
20%
Cubic Planar Graphs
20%
Dagstuhl Seminar
20%
Directed Graph
20%
Disjoint Paths
20%
Disjoint Paths Problem
20%
Domatic number
27%
Exact Algorithm
30%
Exact Satisfiability
20%
Exponential Time
30%
Exponential Time Hypothesis
20%
Exponential-time Algorithms
27%
Extensor
20%
Family of Sets
27%
Fast Algorithm
15%
Graph Coloring Algorithm
20%
Graph Matching
20%
Grassmann Algebra
10%
Inclusion-exclusion Principle
30%
Internet Capabilities
20%
Introductory Computer Programming
20%
K-matching
20%
K-path
20%
Linear Space
20%
Modular Counting
20%
Moebius Syndrome
20%
Multigraph
13%
NC Algorithms
20%
Path Length
16%
Perfect Matching
20%
Polynomial Space
33%
Polynomial Time
50%
Programming Skills
20%
Random Restrictions
20%
Semiring
20%
Set Cover
13%
Set Partitions
20%
Space Constraints
27%
Splittable
20%
Successful Implementation
20%
Time Algorithm
20%
Time Complexity
30%
Time Requirement
27%
Tutte Polynomial
20%
Zeta Transform
37%
Mathematics
Bayesian
10%
Chromatic Number
33%
Chromatic Polynomial
10%
Clique
6%
Clustered Data
10%
Combinatorial Optimization Problem
6%
Commutativity
20%
Dominating Set
6%
Edge
10%
Exp
20%
Exponential Time
57%
Exterior Algebra
20%
Fast Algorithm
15%
Hamiltonian Cycle
13%
Integer
8%
Lattices
6%
Linear Space
20%
Longest Path
20%
Main Result
10%
Matrix (Mathematics)
23%
Maximum Degree
27%
Multigraph
6%
Multiplicative
20%
NP-hard Problem
6%
Odd Number
6%
Open Problem
20%
Path Length
5%
Path Problem
40%
Perfect Matchings
25%
Planar Graph
20%
Polynomial
100%
Polynomial Time
48%
Probability Theory
6%
Running Time
20%
Square Matrix
10%
Starting Point
10%
Summation
10%
Total Length
5%
Vector Space
20%
Worst Case
10%
Computer Science
Approximation Algorithms
10%
Bayesian Learning
10%
Chromatic Number
27%
Clustered Data
10%
Commutativity
20%
Computer Programming
20%
Connected Subgraph
20%
Directed Graphs
5%
Dynamic Programming
10%
Exact Algorithm
30%
Fast Algorithm
15%
Perfect Matchings
25%
Planar Graph
20%
Polynomial Space
33%
Polynomial Time
40%
Polynomial Time Algorithm
10%
Satisfiability Problem
6%
Space Exponential
6%
Space Requirement
10%
Sparsity
6%
Starting Point
10%
Subgraphs
40%
Time Complexity
10%
Time Requirement
10%
Vertex Separator
6%
