RUS  ENG
Full version
JOURNALS // Zhurnal Vychislitel'noi Matematiki i Matematicheskoi Fiziki // Archive

Zh. Vychisl. Mat. Mat. Fiz., 2010 Volume 50, Number 11, Pages 2028–2044 (Mi zvmmf4970)

This article is cited in 1 paper

The use of associative information processing for constructing algorithms for solving systems of Boolean equations

A. S. Meluzov

Faculty of Computational Mathematics and Cybernetics, Moscow State University, Moscow, 119992 Russia

Abstract: Possibilities of the application of dedicated processors based on the use of associative memory for solving systems of Boolean equations is considered. An algorithm for solving systems of Boolean equations using associative dedicated processors is proposed. Classes of systems of Boolean equations that can be efficiently solved by this algorithm are found. Subexponential estimates of the expectation of the computational complexity of the proposed algorithm for solving systems of equations belonging to these classes are obtained.

Key words: system of Boolean equations, associative memory, symbol of a system of equations, agreeing-gluing algorithms.

UDC: 519.7

Received: 19.02.2010
Revised: 25.05.2010


 English version:
Computational Mathematics and Mathematical Physics, 2010, 50:11, 1925–1940

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2024