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)