Sparsity in Algorithms, Combinatorics and Logic (Dagstuhl Seminar 21391).

Daniel Král'Michal Pilipczuk Sebastian Siebertz Blair D. Sullivan

Published in: Dagstuhl Reports (2021)

Keyphrases

computational complexity
graph theory
logic programming
theoretical analysis
orders of magnitude
computational cost
optimization problems
computationally efficient
recently developed
learning algorithm
image processing
benchmark datasets
combinatorial optimization