Bitwise operations related to a combinatorial problem on binary matrices
From MaRDI portal
Publication:6238938
DOI10.5815/IJMECS.2013.04.03arXiv1301.5100MaRDI QIDQ6238938FDOQ6238938
Authors: Krasimir Yordzhev 
Publication date: 22 January 2013
Abstract: Some techniques for the use of bitwise operations are described in the article. As an example, an open problem of isomorphism-free generations of combinatorial objects is discussed. An equivalence relation on the set of square binary matrices having the same number of units in each row and each column is defined. Each binary matrix is represented using ordered n-tuples of natural numbers. It is shown how by using the bitwise operations can be implemented an algorithm that gets canonical representatives which are extremal elements of equivalence classes relative to a double order on the set of considered objects.
Theory of programming languages (68N15) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Programming languages (educational aspects) (97P40)
This page was built for publication: Bitwise operations related to a combinatorial problem on binary matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6238938)
