Mathematical Foundations of Computer Science 2005
From MaRDI portal
Publication:5492863
DOI10.1007/11549345zbMATH Open1156.68623OpenAlexW2494705596MaRDI QIDQ5492863FDOQ5492863
Authors: D. L. Chubarov, Andrei Voronkov
Publication date: 20 October 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11549345
Recommendations
- Algorithm for finding a general formula for the non-negative solutions of a system of linear inequalities
- An algorithm for constructing the basis of the solution set for systems of linear Diophantine equations over the ring of integers
- Combinatorial method for solving systems of linear constraints
- scientific article; zbMATH DE number 1090094
- Finding a partial solution to a linear system of equations in positive integers
Symbolic computation and algebraic computation (68W30) Integer programming (90C10) Linear inequalities of matrices (15A39)
Cited In (6)
- Algorithm for finding a general formula for the non-negative solutions of a system of linear inequalities
- Combinatorial method for solving systems of linear constraints
- Algorithms for solving linear constraints over the ring of integers
- Design of supervisors for linear marking specifications in labeled Petri nets
- Stop-transitions of Petri nets
- Title not available (Why is that?)
Uses Software
This page was built for publication: Mathematical Foundations of Computer Science 2005
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5492863)