14

Answers
votes newest views recent
2
What are the most attractive Turing undecidable problems in mathematics?
9
Fast Matrix Multiplication
9
Old books still used
2
Succinctly naming big numbers: ZFC versus Busy-Beaver
4
when is the independence number of a graph equals the clique cover number
11
Compressing Graphs (Kolmogorov complexity of graphs)
1
Where is it shown how to construct a decomposition tree for a series-parallel graph in linear time?
3
Software for Tree-Decompositions
2
Random Task Scheduling Problem
1
Ramsey pairs of classes graphs
2
Selecting k sub-posets
4
Cliquewidth of Cographs + kv
1
Simple lower bounds for Bell numbers (number of set partitions)?
3
Survey on Structural Complexity