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

Andreas Björklund, Petteri Kaski

Tutkimustuotos: Artikkeli kirjassa/konferenssijulkaisussa › Conference contribution › Scientific › vertaisarvioitu

Alkuperäiskieli	Englanti
Otsikko	Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA)
Toimittajat	Dániel Marx
Kustantaja	Society for Industrial and Applied Mathematics
Sivut	2333-2345
ISBN (elektroninen)	978-1-61197-646-5
DOI - pysyväislinkit	https://doi.org/10.1137/1.9781611976465.139
Tila	Julkaistu - 2021
OKM-julkaisutyyppi	A4 Artikkeli konferenssijulkaisuussa
Tapahtuma	ACM-SIAM Symposium on Discrete Algorithms - Virtual, Online, Alexandria, Yhdysvallat Kesto: 10 tammik. 2021 → 13 tammik. 2021 Konferenssinumero: 32 https://www.siam.org/conferences/cm/conference/soda21

Conference	ACM-SIAM Symposium on Discrete Algorithms
Lyhennettä	SODA
Maa/Alue	Yhdysvallat
Kaupunki	Alexandria
Ajanjakso	10/01/2021 → 13/01/2021
www-osoite	https://www.siam.org/conferences/cm/conference/soda21

Pääsy asiakirjaan

@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. julkaisussa D Marx (Toimittaja), Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA). Society for Industrial and Applied Mathematics, Sivut 2333-2345, ACM-SIAM Symposium on Discrete Algorithms, Alexandria, Virginia, Yhdysvallat, 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). toim. / Dániel Marx. Society for Industrial and Applied Mathematics, 2021. s. 2333-2345.

Tutkimustuotos: Artikkeli kirjassa/konferenssijulkaisussa › Conference contribution › Scientific › vertaisarvioitu

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 contribution

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 -