Counting vanishing matrix-vector products

DOI10.1016/j.tcs.2024.114877MaRDI QIDQ6639735

Kirill Simonov, Viktoriia Korchemna, Cornelius Brand, 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

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fixed-parameter tractability and completeness II: On completeness for W[1]
• Finite computability of Postnikov complexes
• Recursive unsolvability of group theoretic problems
• Diophantine equations, Hilbert series, and undecidable spaces
• Extendability of continuous maps is undecidable
• Explicit bounds for some functions of prime numbers.
• Losing Weight by Gaining Edges
• UNDECIDABILITY BOUNDS FOR INTEGER MATRICES USING CLAUS INSTANCES
• 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