The Fine-Grained Complexity of Computing the Tutte Polynomial of a Linear Matroid.

Andreas Björklund Petteri Kaski

Published in: SODA (2021)

Keyphrases

fine grained
coarse grained
access control
tightly coupled
polynomial hierarchy
greedy algorithm
worst case
massively parallel
databases
low order
bayesian networks
relational databases
space complexity
lagrange interpolation