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...
المؤلف الرئيسي: | Kovács, RA |
---|---|
مؤلفون آخرون: | Hauser, RA |
التنسيق: | أطروحة |
اللغة: | English |
منشور في: |
2023
|
الموضوعات: |
مواد مشابهة
-
Integer programming and combinatorial optimization : 12th International IPCO Conference, Ithaca, NY, USA, June 25-27, 2007 : proceedings /
حسب: Conference on Integer Programming and Combinatorial Optimization (12th : 2007 : Ithaca, New York), وآخرون
منشور في: (2007) -
A HYBRID ALGORITHM FOR THE ROBUST GRAPH COLORING PROBLEM
حسب: Román Anselmo Mora Gutiérrez, وآخرون
منشور في: (2016-08-01) -
Quantifier-Free Boolean Algebra with Presburger Arithmetic is NP-Complete
حسب: Kuncak, Viktor
منشور في: (2007) -
A Framework for Fine-Grained Nonlinearity Optimization of Boolean and Vectorial Boolean Functions
حسب: Miroslav M. Dimitrov
منشور في: (2021-01-01) -
A new efficient transformation of the generalized vehicle routing problem into the classical vehicle routing problem
حسب: Pop Petrica, وآخرون
منشور في: (2011-01-01)