Fast gaussian elimination for low treewidth matrices

dc.contributor.author	Fürer, Martin	pt_BR
dc.contributor.author	Hoppen, Carlos	pt_BR
dc.contributor.author	Trevisan, Vilmar	pt_BR
dc.date.accessioned	2026-02-19T07:59:02Z	pt_BR
dc.date.issued	2025	pt_BR
dc.identifier.uri	http://hdl.handle.net/10183/301599	pt_BR
dc.format.mimetype	application/pdf	pt_BR
dc.language.iso	eng	pt_BR
dc.relation.ispartof	Annual European Symposium on Algorithms (33. : 2025 : Warsaw). Leibniz International Proceedings in Informatics. Wadern, Germany : Schloss Dagstuhl, 2025.	pt_BR
dc.rights	Open Access	en
dc.subject	Gaussian elimination	en
dc.subject	Algoritmos	pt_BR
dc.subject	Largura da árvore	pt_BR
dc.subject	FPT algorithms	en
dc.subject	Treewidth	en
dc.title	Fast gaussian elimination for low treewidth matrices	pt_BR
dc.type	Trabalho completo publicado em evento	pt_BR
dc.contributor.event	Annual European Symposium on Algorithms (33. : 2025 : Warsaw)	pt_BR
dc.identifier.nrb	001295073	pt_BR
dc.type.origin	Estrangeiro	pt_BR

Este item está licenciado na Creative Commons License