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

被引：0
|
作者：
Fedorova V.S. [1 ]
机构：
[1] Lomonosov Moscow State University, Leninskie gory, Moscow
来源：
Journal of Applied and Industrial Mathematics | 2013年 / 7卷 / 03期
关键词：
complexity; functional Boolean equation; satisfiability;
D O I：
10.1134/S1990478913030071
中图分类号：
学科分类号：
摘要：
We consider functional Boolean equations and the satisfiability problem for them, which amounts to the following: Does there exist a Boolean function satisfying a given functional equation? We establish upper and lower bounds for the complexity of the satisfiability problem for a system of functional Boolean equations. This justifies the impossibility of its solution by any method substantially simpler than the brute-force search. © 2013 Pleiades Publishing, Ltd.
引用
收藏
页码：344 / 354
页数：10
相关论文
共 50 条
  • [1] On complexity of problem of satisfiability for systems of countable-valued functional equations
    Kalinina I.S.
    Marchenkov S.S.
    Russian Mathematics, 2015, 59 (8) : 19 - 24
  • [2] On the Structure of the Boolean Satisfiability Problem: A Survey
    Alyahya, Tasniem Nasser
    Menai, Mohamed El Bachir
    Mathkour, Hassan
    ACM COMPUTING SURVEYS, 2023, 55 (03)
  • [3] The Boolean SATisfiability Problem in Clifford algebra
    Budinich, Marco
    THEORETICAL COMPUTER SCIENCE, 2019, 784 : 1 - 10
  • [4] Solving the satisfiability problem through Boolean networks
    Milano, M
    Roli, A
    AI*IA 99: ADVANCES IN ARTIFICIAL INTELLIGENCE, 2000, 1792 : 72 - 83
  • [5] Satisfiability in Boolean Logic (SAT problem) is polynomial
    Rybakov, Vladimir V.
    JOURNAL OF SIBERIAN FEDERAL UNIVERSITY-MATHEMATICS & PHYSICS, 2021, 14 (05): : 667 - 671
  • [6] A Quantum Annealing Approach for Boolean Satisfiability Problem
    Su, Juexiao
    Tu, Tianheng
    He, Lei
    2016 ACM/EDAC/IEEE DESIGN AUTOMATION CONFERENCE (DAC), 2016,
  • [7] Modified Neural Net for the Boolean Satisfiability Problem
    Mejia-Lavalle, Manuel
    Jose Ruiz, A.
    Joaquin Perez, O.
    Marilu Cervantes, S.
    2015 INTERNATIONAL CONFERENCE ON MECHATRONICS, ELECTRONICS, AND AUTOMOTIVE ENGINEERING (ICMEAE 2015), 2015, : 64 - 69
  • [8] THE COMPLEXITY OF THE SATISFIABILITY PROBLEM FOR KROM FORMULAS
    DENENBERG, L
    LEWIS, HR
    THEORETICAL COMPUTER SCIENCE, 1984, 30 (03) : 319 - 341
  • [9] Algebraic characteristics and satisfiability threshold of random Boolean equations
    Guo, Binghui
    Wei, Wei
    Sun, Yifan
    Zheng, Zhiming
    PHYSICAL REVIEW E, 2010, 81 (03):
  • [10] Machine Learning Methods in Solving the Boolean Satisfiability Problem
    Guo, Wenxuan
    Zhen, Hui-Ling
    Li, Xijun
    Luo, Wanqian
    Yuan, Mingxuan
    Jin, Yaohui
    Yan, Junchi
    MACHINE INTELLIGENCE RESEARCH, 2023, 20 (05) : 640 - 655
12345