Generic complexity of the membership problem for semigroups of integer matrices
From MaRDI portal
Recommendations
- Decidability of the membership problem for \(2\times 2\) integer matrices
- scientific article; zbMATH DE number 7204378
- Some decision problems on integer matrices
- On generic complexity of the subset sum problem for semigroups of integer matrices
- The identity problem for matrix semigroups in \(\mathrm{SL}_2(\mathbb{Z})\) is NP-complete
Cites work
- scientific article; zbMATH DE number 3651744 (Why is no real title available?)
- scientific article; zbMATH DE number 3664741 (Why is no real title available?)
- scientific article; zbMATH DE number 3257446 (Why is no real title available?)
- A probabilistic remark on algebraic program testing
- Average Case Complete Problems
- Average case completeness
- Binary solutions to large systems of linear equations
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Generic computability, Turing degrees, and asymptotic density
- Generic-case complexity, decision problems in group theory, and random walks.
- Mortality in Matrix Semigroups
- Random Graph Isomorphism
- Some Questions in Computable Mathematics
- Unsolvability in 3 × 3 Matrices
Cited in
(3)
This page was built for publication: Generic complexity of the membership problem for semigroups of integer matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5071228)
