A decision algorithm for linear sentences on a PFM
From MaRDI portal
Publication:685065
Recommendations
Cites work
- scientific article; zbMATH DE number 3881899 (Why is no real title available?)
- scientific article; zbMATH DE number 3991424 (Why is no real title available?)
- scientific article; zbMATH DE number 3687544 (Why is no real title available?)
- scientific article; zbMATH DE number 3467028 (Why is no real title available?)
- scientific article; zbMATH DE number 3445421 (Why is no real title available?)
- A decision algorithm for linear sentences on a PFM
- Decidable sentences of Church-Rosser congruences
- Fast Parallel Computation of Hermite and Smith Forms of Polynomial Matrices
- Komplexität von Entscheidungsproblemen. Ein Seminar
- Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix
- Solving systems of linear equations over polynomials
- The computational complexity of logical theories
- Thue systems as rewriting systems
Cited in
(3)
This page was built for publication: A decision algorithm for linear sentences on a PFM
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q685065)