Skip to main content
SpringerLink
Log in

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

  • Published:
Computational Mathematics and Mathematical Physics Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. D. Cox, J. Little, and D. O’shea, Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra (Springer, New York, 1997; Mir, Moscow, 2000).

    Google Scholar 

  2. M. Bardet, J.-C. Faugére, and B. Salvy, “On the Complexity of Gröebner Basis Computation of Semi-Regular Overdetermined Algebraic Equations,” ICPSS, (2004), pp. 71–75.

  3. V. K. Leont’ev and G. P. Tonoyan, “Approximate Solution of Systems of Boolean Equations,” Zh. Vychisl. Mat. Mat. Fiz. 33(9), 1383–1390 (1993).

    MATH  MathSciNet  Google Scholar 

  4. H. Raddum and I. Semaev, “New Technique for Solving Sparse Equation Systems,” http://eprint.iacr.org/2006/475.pdf.

  5. I. Semaev, “On Solving Sparse Algebraic Equations over Finite Fields. I,” in Proc. WCC’07, Versailles, France (INRIA, 2007), pp. 361–370.

  6. I. Semaev, “On Solving Sparse Algebraic Equations over Finite Fields. II,” http://eprint.iacr.org/2007/280.pdf.

  7. C. C. Foster, Content Addressable Parallel Processors (Van Nostrand Reinhold, New York, 1976; Energoizdat, Moscow, 1981).

    Google Scholar 

Download references

Author information

Authors and Affiliations

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

    A. S. Meluzov

Authors
  1. A. S. Meluzov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to A. S. Meluzov.

Additional information

Original Russian Text © A.S. Meluzov, 2010, published in Zhurnal Vychislitel’noi Matematiki i Matematicheskoi Fiziki, 2010, Vol. 50, No. 11, pp. 2028–2044.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Meluzov, A.S. The use of associative information processing for constructing algorithms for solving systems of Boolean equations. Comput. Math. and Math. Phys. 50, 1925–1940 (2010). https://doi.org/10.1134/S0965542510110151

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0965542510110151

Keywords

Search

Navigation