Solution of the safe problem on (0,1)-matrices

DOI10.1023/A:1015596100010zbMath1054.15004OpenAlexW1486039914MaRDI QIDQ1407346

Georg A. Donets

Publication date: 16 September 2003

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

Full work available at URL: https://doi.org/10.1023/a:1015596100010

zbMATH Keywords

linear Diophantine equationssystem of linear equationscomputer gamessafe problem

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Applications of game theory (91A80) Matrices of integers (15B36) Linear equations (linear algebraic aspects) (15A06)

Related Items (11)

Statement and solution of some problems on a mathematical safe ⋮ Solution algorithms for systems of linear equations over residue rings ⋮ An algorithm for constructing the basis of the solution set for systems of linear Diophantine equations over the ring of integers ⋮ Algorithms for solution of systems of linear Diophantine equations in residue fields ⋮ Algorithms for solving systems of linear Diophantine equations in residue rings ⋮ Combinatorial method for solving systems of linear constraints ⋮ Methods for solving problems of mathematical safes on matrices with different types of locks ⋮ Numerical methods to solve problems on a mathematical safe ⋮ Matrices associated with \(D\)-distance magic graphs and their properties ⋮ Solution of a matrix problem on a mathematical safe for locks of the same kind. I ⋮ Application of commutative rings with unity for construction of symmetric encryption system

This page was built for publication: Solution of the safe problem on (0,1)-matrices