Binary matrix factorisations under Boolean arithmetic
<p>For a binary matrix <strong>X</strong>, the Boolean rank <em><strong>br</em></strong>(<strong>X</strong>) is the smallest integer for which <strong>X</strong> can be factorised into the Boolean matrix product of two binary matrices...
Hlavní autor: | Kovács, RA |
---|---|
Další autoři: | Hauser, RA |
Médium: | Diplomová práce |
Jazyk: | English |
Vydáno: |
2023
|
Témata: |
Podobné jednotky
-
Integer programming and combinatorial optimization : 12th International IPCO Conference, Ithaca, NY, USA, June 25-27, 2007 : proceedings /
Autor: Conference on Integer Programming and Combinatorial Optimization (12th : 2007 : Ithaca, New York), a další
Vydáno: (2007) -
A HYBRID ALGORITHM FOR THE ROBUST GRAPH COLORING PROBLEM
Autor: Román Anselmo Mora Gutiérrez, a další
Vydáno: (2016-08-01) -
Quantifier-Free Boolean Algebra with Presburger Arithmetic is NP-Complete
Autor: Kuncak, Viktor
Vydáno: (2007) -
A Framework for Fine-Grained Nonlinearity Optimization of Boolean and Vectorial Boolean Functions
Autor: Miroslav M. Dimitrov
Vydáno: (2021-01-01) -
A new efficient transformation of the generalized vehicle routing problem into the classical vehicle routing problem
Autor: Pop Petrica, a další
Vydáno: (2011-01-01)