The Satisfiability Problem for Probabilistic Ordered Branching Programs

被引：0
|
作者：
M. Agrawal
T. Thierauf
机构：
[1] Department of Computer Science,
[2] India ,undefined
来源：
Theory of Computing Systems | 2001年 / 34卷
关键词：
Boolean Function; Equivalence Problem; Acceptance Probability; Initial Node; Binary Decision Diagram;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
We show that the satisfiability problem for bounded-error probabilistic ordered branching programs is \NP -complete. If 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.
引用
收藏
页码：471 / 487
页数：16
相关论文
共 50 条
  • [1] The satisfiability problem for probabilistic ordered branching programs
    Agrawal, M
    Thierauf, T
    [J]. THEORY OF COMPUTING SYSTEMS, 2001, 34 (05) : 471 - 487
  • [2] The satisfiability problem for probabilistic ordered branching programs
    Agrawal, M
    Thierauf, T
    [J]. THIRTEENTH ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY - PROCEEDINGS, 1998, : 81 - 90
  • [3] Ordered quantum branching programs are more powerful than ordered probabilistic branching programs under a bounded-width restriction
    Nakanishi, M
    Hamaguchi, K
    Kashiwabara, T
    [J]. COMPUTING AND COMBINATORICS, PROCEEDINGS, 2000, 1858 : 467 - 476
  • [4] PROBABILISTIC APPROACH TO THE SATISFIABILITY PROBLEM
    DUBOIS, O
    CARLIER, J
    [J]. THEORETICAL COMPUTER SCIENCE, 1991, 81 (01) : 65 - 75
  • [5] The satisfiability problem for probabilistic CTL
    Brazdil, Tomas
    Forejt, Vojtech
    Kretinsky, Jan
    Kucera, Antonin
    [J]. TWENTY-THIRD ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE, PROCEEDINGS, 2008, : 391 - 402
  • [6] Constraint Branching in Workflow Satisfiability Problem
    Gutin, Gregory
    Karapetyan, Daniel
    [J]. SACMAT'20: PROCEEDINGS OF THE 25TH ACM SYMPOSIUM ON ACCESS CONTROL MODELS AND TECHNOLOGIES, 2020, : 93 - 103
  • [7] PROBABILISTIC PERFORMANCE OF A HEURISTIC FOR THE SATISFIABILITY PROBLEM
    FRANCO, J
    HO, YC
    [J]. DISCRETE APPLIED MATHEMATICS, 1988, 22 (01) : 35 - 51
  • [8] ON THE PROBABILISTIC PERFORMANCE OF ALGORITHMS FOR THE SATISFIABILITY PROBLEM
    FRANCO, J
    [J]. INFORMATION PROCESSING LETTERS, 1986, 23 (02) : 103 - 106
  • [9] On the Probabilistic approach to the random satisfiability problem
    Parisi, G
    [J]. THEORY AND APPLICATIONS OF SATISFIABILITY TESTING, 2004, 2919 : 203 - 213
  • [10] A Refined Branching Algorithm for the Maximum Satisfiability Problem
    Wenjun Li
    Chao Xu
    Yongjie Yang
    Jianer Chen
    Jianxin Wang
    [J]. Algorithmica, 2022, 84 : 982 - 1006
12345