The satisfiability problem for probabilistic ordered branching programs

被引：3
|
作者：
Agrawal, M [1 ]
Thierauf, T [1 ]
机构：
[1] Indian Inst Technol, Dept Comp Sci, Kanpur 208016, Uttar Pradesh, India
来源：
THIRTEENTH ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY - PROCEEDINGS | 1998年
关键词：
D O I：
10.1109/CCC.1998.694593
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We show that the satisfiability problem for bounded error probabilistic ordered branching programs is NP - complete. IS the error is very small however (more precisely, if the error is bounded by the reciprocal of the width of the branching program), then we have a polynomial-time algorithm for the satisfiability problem.
引用
收藏
页码：81 / 90
页数：10
相关论文
共 50 条
  • [41] Classical Generalized Probabilistic Satisfiability
    Caleiro, Carlos
    Casal, Filipe
    Mordido, Andreia
    PROCEEDINGS OF THE TWENTY-SIXTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2017, : 908 - 914
  • [42] BRANCHING PROGRAMS VERSUS OBLIVIOUS BRANCHING PROGRAMS
    HROMKOVIC, J
    COMPUTERS AND ARTIFICIAL INTELLIGENCE, 1991, 10 (01): : 67 - 74
  • [43] On BPP versus NP ∨ coNP for ordered read-once branching programs
    Ablayev, F
    Karpinski, M
    Mubarakzjanov, R
    THEORETICAL COMPUTER SCIENCE, 2001, 264 (01) : 127 - 137
  • [44] Deterministic black-box identity testing π-ordered algebraic branching programs
    Jansen, Maurice
    Qiao, Youming
    Jayalal Sarma, M.N.
    Leibniz International Proceedings in Informatics, LIPIcs, 2010, 8 : 296 - 307
  • [45] Deterministic Black-Box Identity Testing π-Ordered Algebraic Branching Programs
    Jansen, Maurice
    Qiao, Youming
    Sarma, Jayalal M. N.
    IARCS ANNUAL CONFERENCE ON FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE (FSTTCS 2010), 2010, 8 : 296 - 307
  • [46] Improving two-mode algorithm via probabilistic selection for solving satisfiability problem
    Fu, Huimin
    Cai, Shaowei
    Wu, Guanfeng
    Liu, Jun
    Yang, Xin
    Xu, Yang
    INFORMATION SCIENCES, 2024, 653
  • [47] Satisfiability Modulo Recursive Programs
    Suter, Philippe
    Koeksal, Ali Sinan
    Kuncak, Viktor
    STATIC ANALYSIS, 2011, 6887 : 298 - 315
  • [48] Branching rules for satisfiability analysed with factor analysis
    Wallace, Richard J.
    Bain, Stuart
    AI 2007: ADVANCES IN ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2007, 4830 : 803 - +
  • [49] The probabilistic analysis of a greedy satisfiability algorithm
    Kaporis, Alexis C.
    Kirousis, Lefteris M.
    Lalas, Efthimios G.
    RANDOM STRUCTURES & ALGORITHMS, 2006, 28 (04) : 444 - 480
  • [50] On Probabilistic Generalization of Backdoors in Boolean Satisfiability
    Semenov, Alexander
    Pavlenko, Artem
    Chivilikhin, Daniil
    Kochemazov, Stepan
    THIRTY-SIXTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE / THIRTY-FOURTH CONFERENCE ON INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE / TWELVETH SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2022, : 10353 - 10361
12345