Counting vanishing matrix-vector products

DOI10.1016/J.TCS.2024.114877MaRDI QIDQ6639735zbMATH OpenFDO

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

Publication date 18 November 2024

Published in Theoretical Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Parameterized complexity, tractability and kernelization (68Q27) Homotopy theory (55Pxx)

Cites work

• 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?)
• Combinatorial homotopy. I
• Combinatorial homotopy. II
• Diophantine equations, Hilbert series, and undecidable spaces
• Explicit bounds for some functions of prime numbers.
• Extendability of continuous maps is undecidable
• Finite computability of Postnikov complexes
• Fixed-parameter tractability and completeness II: On completeness for W[1]
• From geometry to topology.
• Losing weight by gaining edges
• Polynomial-time computation of homotopy groups and Postnikov systems in fixed dimension
• Recursive unsolvability of group theoretic problems
• The Parameterized Complexity of Counting Problems
• The word problem
• Undecidability bounds for integer matrices using Claus instances

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 Q6639735)