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...
Main Author: | Kovács, RA |
---|---|
Other Authors: | Hauser, RA |
Format: | Thesis |
Language: | English |
Published: |
2023
|
Subjects: |
Similar Items
-
Integer programming and combinatorial optimization : 12th International IPCO Conference, Ithaca, NY, USA, June 25-27, 2007 : proceedings /
by: Conference on Integer Programming and Combinatorial Optimization (12th : 2007 : Ithaca, New York), et al.
Published: (2007) -
A HYBRID ALGORITHM FOR THE ROBUST GRAPH COLORING PROBLEM
by: Román Anselmo Mora Gutiérrez, et al.
Published: (2016-08-01) -
Quantifier-Free Boolean Algebra with Presburger Arithmetic is NP-Complete
by: Kuncak, Viktor
Published: (2007) -
A Framework for Fine-Grained Nonlinearity Optimization of Boolean and Vectorial Boolean Functions
by: Miroslav M. Dimitrov
Published: (2021-01-01) -
A new efficient transformation of the generalized vehicle routing problem into the classical vehicle routing problem
by: Pop Petrica, et al.
Published: (2011-01-01)