5 papers
A Method for Fast Computing the Algebraic Degree of Boolean Functions
Valentin Bakoev
The algebraic degree of Boolean functions (or vectorial Boolean functions) is an important cryptographic parameter that should be computed by fast algorithms. They work in two main…
Fast Computing the Algebraic Degree of Boolean Functions
Valentin Bakoev
Here we consider an approach for fast computing the algebraic degree of Boolean functions. It combines fast computing the ANF (known as ANF transform) and thereafter the algebraic…
Combinatorial and Algorithmic Properties of One Matrix Structure at Monotone Boolean Functions
Valentin Bakoev
One matrix structure in the area of monotone Boolean functions is defined here. Some of its combinatorial, algebraic and algorithmic properties are derived. On the base of these pr…
Some Problems and Algorithms Related to the Weight Order Relation on the -dimensional Boolean Cube
Valentin Bakoev
The problem "Given a Boolean function of variables by its truth table vector. Find (if exists) a vector of maximal (or minimal) weight, such that …
Enumeration of Some Closed Knight Paths
Stoyan Kapralov, Valentin Bakoev, Kaloyan Kapralov
The aim of the paper is to enumerate all closed knight paths of length n over a square board of size n+1. The closed knight paths of length 4, 6 and 8 are classified up to equivale…