1 citations · 1 across the 6 of their papers we have counts for
7 papers
Algorithms for Construction, Classification and Enumeration of Closed Knight's Paths
Stoyan Kapralov, Valentin Bakoev, Kaloyan Kapralov
Two algorithms for construction of all closed knight's paths of lengths up to 16 are presented. An approach for classification (up to equivalence) of all such paths is considered.…
About the Study of the -dimensional Boolean Cube in the Bachelor's Programs in Computer Science
Valentin Bakoev
Here we present our arguments for a more in-depth study of the Boolean cube, which is one of the most important discrete structures. The article contains a case study that analyses…
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 …