Diskretnyi Analiz i Issledovanie Operatsii
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Diskretn. Anal. Issled. Oper.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Diskretnyi Analiz i Issledovanie Operatsii, 2013, Volume 20, Issue 3, Pages 84–100 (Mi da734)  
This article is cited in 1 scientific paper (total in 1 paper)

On the complexity of the satisfiability problem for a system of functional Boolean equations

V. S. Fedorova

Lomonosov Moscow State University, Leninskie gory, 119991 Moscow, Russia
Full-text PDF (291 kB) Citations (1)
References:
PDF
HTML
Abstract: Functional Boolean equations and the satisfiability problem for them are considered. The satisfiability problem is the following: is there any solution to the functional equation among Boolean functions? The upper and the lower bounds on the complexity of the satisfiability problem for a system of functional Boolean equations are established. This result shows that it is impossible to solve a system of functional Boolean equations by the method which has much less complexity than the method of direct enumeration. Bibliogr. 10.
Keywords: functional Boolean equation, satisfiability problem, complexity.
Received: 18.06.2012
English version:
Journal of Applied and Industrial Mathematics, 2013, Volume 7, Issue 3, Pages 344–354
DOI: https://doi.org/10.1134/S1990478913030071
Bibliographic databases:
Document Type: Article
UDC: 519.71
Language: Russian
Citation: V. S. Fedorova, “On the complexity of the satisfiability problem for a system of functional Boolean equations”, Diskretn. Anal. Issled. Oper., 20:3 (2013), 84–100; J. Appl. Industr. Math., 7:3 (2013), 344–354
Citation in format AMSBIB
\Bibitem{Fed13}
\by V.~S.~Fedorova
\paper On the complexity of the satisfiability problem for a~system of functional Boolean equations
\jour Diskretn. Anal. Issled. Oper.
\yr 2013
\vol 20
\issue 3
\pages 84--100
\mathnet{http://mi.mathnet.ru/da734}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=3135746}
\transl
\jour J. Appl. Industr. Math.
\yr 2013
\vol 7
\issue 3
\pages 344--354
\crossref{https://doi.org/10.1134/S1990478913030071}
Linking options:
  • https://www.mathnet.ru/eng/da734
  • https://www.mathnet.ru/eng/da/v20/i3/p84
    • This publication is cited in the following 1 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретный анализ и исследование операций
    Statistics & downloads:
    Abstract page:343
    Full-text PDF :99
    References:75
    First page:7
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024