Counting vanishing matrix-vector products

DOI10.1007/978-981-97-0566-5_24MaRDI QIDQ6575406

Kirill Simonov, Viktoriia Korchemna, Cornelius Brand, Michael Skotnica

Publication date: 19 July 2024

zbMATH Keywords

undecidabilityhomotopy groupparameterized complexity\(k\)-sum\textsf{W}[2-hardness]

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fixed-parameter tractability and completeness II: On completeness for W[1]
• Finite computability of Postnikov complexes
• Diophantine equations, Hilbert series, and undecidable spaces
• Extendability of continuous maps is undecidable
• Losing Weight by Gaining Edges
• The Parameterized Complexity of Counting Problems
• Polynomial-Time Computation of Homotopy Groups and Postnikov Systems in Fixed Dimension
• Combinatorial homotopy. I
• Combinatorial homotopy. II
• The word problem

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