Finding a partial solution to a linear system of equations in positive integers
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3121281 (Why is no real title available?)
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 3995771 (Why is no real title available?)
- scientific article; zbMATH DE number 3275139 (Why is no real title available?)
- An Algorithm for the General Petri Net Reachability Problem
- An algorithm to generate the basis of solutions to homogeneous linear Diophantine equations
Cited in
(6)- A structure to decide reachability in Petri nets
- Mathematical Foundations of Computer Science 2005
- Computation of atomic fibers of \(\mathbb Z\)-linear maps
- \(\mathbb N\)-solutions to linear systems over \(\mathbb Z\)
- On minimal elements in the set of integer nonnegative solutions of a system of linear equations
- scientific article; zbMATH DE number 4050867 (Why is no real title available?)
This page was built for publication: Finding a partial solution to a linear system of equations in positive integers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1105986)