Determinantal sieving

DOI10.46298/THEORETICS.25.21MaRDI QIDQ6912580zbMATH OpenFDO

Authors Eduard Eiben, Tomohiro Koana, Magnus Wahlström

Publication date 22 October 2025

Published in TheoretiCS (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

parameterized complexitymatroid theoryalgebraic algorithmsFPT algorithms

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Combinatorial aspects of matroids and geometric lattices (05B35) Parameterized complexity, tractability and kernelization (68Q27)

This page was built for publication: Determinantal sieving

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6912580)