Counting vanishing matrix-vector products

DOI10.1007/978-981-97-0566-5_24MaRDI QIDQ6575406zbMATH OpenFDO

Authors Cornelius Brand, Viktoriia Korchemna, Kirill Simonov, Michael Skotnica

Publication date 19 July 2024

Full work available at URL https://doi.org/10.1007/978-981-97-0566-5_24

zbMATH Keywords

\(k\)-sum\textsf{W}[2-hardness]homotopy groupparameterized complexityundecidability

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• Combinatorial homotopy. I
• Combinatorial homotopy. II
• Diophantine equations, Hilbert series, and undecidable spaces
• Extendability of continuous maps is undecidable
• Finite computability of Postnikov complexes
• Fixed-parameter tractability and completeness II: On completeness for W[1]
• scientific article; zbMATH DE number 4131262 (Why is no real title available?)
• scientific article; zbMATH DE number 3645234 (Why is no real title available?)
• scientific article; zbMATH DE number 4147093 (Why is no real title available?)
• scientific article; zbMATH DE number 3360092 (Why is no real title available?)
• Losing weight by gaining edges
• Polynomial-time computation of homotopy groups and Postnikov systems in fixed dimension
• The Parameterized Complexity of Counting Problems
• The word problem

This page was built for publication: Counting vanishing matrix-vector products

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