Counting vanishing matrix-vector products
From MaRDI portal
Publication:6639735
DOI10.1016/J.TCS.2024.114877MaRDI QIDQ6639735FDOQ6639735
Authors: Cornelius Brand, Viktoriia Korchemna, Kirill Simonov, Michael Skotnica 
Publication date: 18 November 2024
Published in: Theoretical Computer Science (Search for Journal in Brave)
Cites Work
- Combinatorial homotopy. II
- Fixed-parameter tractability and completeness II: On completeness for W[1]
- Undecidability bounds for integer matrices using Claus instances
- Title not available (Why is that?)
- The word problem
- Title not available (Why is that?)
- The Parameterized Complexity of Counting Problems
- Combinatorial homotopy. I
- Recursive unsolvability of group theoretic problems
- From geometry to topology.
- Diophantine equations, Hilbert series, and undecidable spaces
- Extendability of continuous maps is undecidable
- Polynomial-time computation of homotopy groups and Postnikov systems in fixed dimension
- Title not available (Why is that?)
- Finite computability of Postnikov complexes
- Explicit bounds for some functions of prime numbers.
- Losing weight by gaining edges
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)
