On algorithms for solving systems of linear Diophantine constraints over the set \{0,1\}

DOI10.1023/B:CASA.0000012088.53339.A7MaRDI QIDQ557413zbMATH OpenOpenAlexFDO

Authors S. L. Kryvyi

Publication date 30 June 2005

Published in Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/b:casa.0000012088.53339.a7

zbMATH Keywords

basis of a set of solutionsdeadlocklinear constraintsminimum generating set of solutionstraps of Petri nets

Mathematics Subject Classification ID

Linear Diophantine equations (11D04) Computer solution of Diophantine equations (11Y50) Numerical linear algebra (65F99)

Cited in

(1)

• Algorithms for solving linear constraints over the set \(\{0, 1\}\)

This page was built for publication: On algorithms for solving systems of linear Diophantine constraints over the set \{0,1\}

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q557413)