Calculating the cardinality of some classes of binary matrices using bitwise operations — A polynomial algorithm

DOI10.1142/S1793830919500381zbMath1492.68147OpenAlexW2947620438MaRDI QIDQ4968285

Krasimir Yordzhev

Publication date: 12 July 2019

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830919500381

zbMATH Keywords

polynomial algorithmbinary matrixbitwise operationssemi-canonical binary matrix\(n\)-tuples of integersprimitive binary matrix

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Boolean and Hadamard matrices (15B34)

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The enumeration of arrays and a generalization related to contingency tables
• Enumeration of stochastic cubes
• On the number of mutually disjoint pairs of \(S\)-permutation matrices
• On the cardinality of a factor set of binary matrices
• A combinatorial distribution problem
• Semi-canonical binary matrices

This page was built for publication: Calculating the cardinality of some classes of binary matrices using bitwise operations — A polynomial algorithm