ETH-tight algorithms for finding surfaces in simplicial complexes of bounded treewidth.

Mitchell Black Nello Blaser Amir Nayyeri Erlend Raa Vågset

Published in: CoRR (2022)

Keyphrases

highly parallelizable
worst case
bounded treewidth
databases
computational complexity
machine learning
decision trees
lower bound
state space
graph theory