Login / Signup
The Fine-Grained Complexity of Computing the Tutte Polynomial of a Linear Matroid.
Andreas Björklund
Petteri Kaski
Published in:
CoRR (2020)
Keyphrases
</>
fine grained
coarse grained
access control
low order
tightly coupled
polynomial hierarchy
higher order
greedy algorithm
data lineage
worst case
massively parallel
combinatorial optimization