The fine-grained complexity of computing the Tutte polynomial of a linear matroid

Andreas Björklund, Petteri Kaski

Research output: Chapter in Book/Report/Conference proceeding › Conference article in proceedings › Scientific › peer-review

Original language	English
Title of host publication	Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA)
Editors	Dániel Marx
Publisher	Society for Industrial and Applied Mathematics
Pages	2333-2345
ISBN (Electronic)	978-1-61197-646-5
DOIs	https://doi.org/10.1137/1.9781611976465.139
Publication status	Published - 2021
MoE publication type	A4 Conference publication
Event	ACM-SIAM Symposium on Discrete Algorithms - Virtual, Online, Alexandria, United States Duration: 10 Jan 2021 → 13 Jan 2021 Conference number: 32 https://www.siam.org/conferences/cm/conference/soda21

Conference	ACM-SIAM Symposium on Discrete Algorithms
Abbreviated title	SODA
Country/Territory	United States
City	Alexandria
Period	10/01/2021 → 13/01/2021
Internet address	https://www.siam.org/conferences/cm/conference/soda21

Access to Document

@inproceedings{8ff6261f4c724e6aa3e1f21ce62841c8,

title = "The fine-grained complexity of computing the Tutte polynomial of a linear matroid",

author = "Andreas Bj{\"o}rklund and Petteri Kaski",

year = "2021",

doi = "10.1137/1.9781611976465.139",

language = "English",

pages = "2333--2345",

editor = "D{\'a}niel Marx",

booktitle = "Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA)",

publisher = "Society for Industrial and Applied Mathematics",

address = "United States",

note = "ACM-SIAM Symposium on Discrete Algorithms, SODA ; Conference date: 10-01-2021 Through 13-01-2021",

url = "https://www.siam.org/conferences/cm/conference/soda21",

}

Björklund, A & Kaski, P 2021, The fine-grained complexity of computing the Tutte polynomial of a linear matroid. in D Marx (ed.), Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA). Society for Industrial and Applied Mathematics, pp. 2333-2345, ACM-SIAM Symposium on Discrete Algorithms, Alexandria, Virginia, United States, 10/01/2021. https://doi.org/10.1137/1.9781611976465.139

The fine-grained complexity of computing the Tutte polynomial of a linear matroid. / Björklund, Andreas; Kaski, Petteri.
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA). ed. / Dániel Marx. Society for Industrial and Applied Mathematics, 2021. p. 2333-2345.

Research output: Chapter in Book/Report/Conference proceeding › Conference article in proceedings › Scientific › peer-review

TY - GEN

T1 - The fine-grained complexity of computing the Tutte polynomial of a linear matroid

AU - Björklund, Andreas

AU - Kaski, Petteri

N1 - Conference code: 32

PY - 2021

Y1 - 2021

U2 - 10.1137/1.9781611976465.139

DO - 10.1137/1.9781611976465.139

M3 - Conference article in proceedings

SP - 2333

EP - 2345

BT - Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA)

A2 - Marx, Dániel

PB - Society for Industrial and Applied Mathematics

T2 - ACM-SIAM Symposium on Discrete Algorithms

Y2 - 10 January 2021 through 13 January 2021

ER -