Related papers: Efficient Generation of Binary Magic Squares
A simple binary model to compute the degree of balancedness in the output sequence of LFSR-combinational generators has been developed. The computational method is based exclusively on the handling of binary strings by means of logic…
Based on Restricted Boltzmann Machines (RBMs), an improved pseudo-stochastic sequential cipher generator is proposed. It is effective and efficient because of the two advantages: this generator includes a stochastic neural network that can…
We provide an algorithm to construct unitary matrices over finite fields. We present various constructions of Hermitian self-dual code by means of unitary matrices, where some of them generalize the quadratic double circulant constructions.…
One of the biggest huddles faced by researchers studying algorithms for massive graphs is the lack of large input graphs that are essential for the development and test of the graph algorithms. This paper proposes two efficient and highly…
In this paper, we present fast algorithms for the product of two multivariate polynomials in sparse representation. The bit complexity of our algorithms are studied in detail for various types of coefficients, and we derive new complexity…
Symmetry in integer programming causes redundant search and is often handled with symmetry breaking constraints that remove as many equivalent solutions as possible. We propose an algebraic method which allows to generate a random family of…
Hadamard matrices are square $n\times n$ matrices whose entries are ones and minus ones and whose rows are orthogonal to each other with respect to the standard scalar product in $\Bbb R^n$. Each Hadamard matrix can be transformed to a…
The main purpose of this paper is providing a simple method to generate the matrices of irreducible representations because it is useful to reduce the computational time of solving the eigenvalue problems. The only information we need to…
This paper proposes a fully-automatic, text-guided generative method for producing perfectly-repeating, periodic, tile-able 2D imagery, such as the one seen on floors, mosaics, ceramics, and the work of M.C. Escher. In contrast to square…
We propose an algorithm for low rank matrix completion for matrices with binary entries which obtains explicit binary factors. Our algorithm, which we call TBMC (\emph{Tiling for Binary Matrix Completion}), gives interpretable output in the…
We propose a strategy for the generation of fast and accurate versions of non-commutative recursive matrix multiplication algorithms. To generate these algorithms, we consider matrix and tensor norm bounds governing the stability and…
Processors may find some elementary operations to be faster than the others. Although an operation may be conceptually as simple as some other operation, the processing speeds of the two can vary. A clever programmer will always try to…
The minimum sum-of-squares clustering problem (MSSC), also known as $k$-means clustering, refers to the problem of partitioning $n$ data points into $k$ clusters, with the objective of minimizing the total sum of squared Euclidean distances…
We propose a successive generation of cutting inequalities for binary quadratic optimization problems. Multiple cutting inequalities are successively generated for the convex hull of the set of the optimal solutions $\subset \{0, 1\}^n$,…
It is well known, and appreciated, that quantum computers have the potential to be the most powerful computational devices ever created. This newfound power comes from a quantum parallelism effect that allows the computer to be in multiple…
Inspired by [4] we present a new algorithm for uniformly random generation of ordered trees in which all occuring outdegrees can be specified by a given sequence of numbers. The method can be used for random generation of binary or n-ary…
This paper presents the first generic bi-objective binary linear branch-and-cut algorithm. Studying the impact of valid inequalities in solution and objective spaces, two cutting frameworks are proposed. The multi-point separation problem…
We describe a general algorithm for generating various families of ribbon tableaux and computing their spin polynomials. This algorithm is derived from a new matricial coding. An advantage of this new notation lies in the fact that it…
It is unknown at present whether a magic square of squared integers exists. Such an object is defined to be a 3 by 3 grid of 9 distinct integer squares, such that the entries of each row, column, and two main diagonals sum to the same…
Primitive polynomials over finite fields are crucial for various domains of computer science, including classical pseudo-random number generation, coding theory and post-quantum cryptography. Nevertheless, the pursuit of an efficient…