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 条
  • [31] Generalized Probabilistic Satisfiability
    Caleiro C.
    Casal F.
    Mordido A.
    Electronic Notes in Theoretical Computer Science, 2017, 332 : 39 - 56
  • [32] Randomization and nondeterminism are comparable for ordered read-once branching programs
    Ablayev, F
    AUTOMATA, LANGUAGES AND PROGRAMMING, 1997, 1256 : 195 - 202
  • [33] Easy Cases of Probabilistic Satisfiability
    Kim Allan Andersen
    Daniele Pretolani
    Annals of Mathematics and Artificial Intelligence, 2001, 33 : 69 - 91
  • [34] Mixed-integer column generation algorithms and the probabilistic maximum satisfiability problem
    Hansen, P
    Jaumard, B
    de Aragao, MP
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1998, 108 (03) : 671 - 683
  • [35] Probabilistic satisfiability with imprecise probabilities
    Hansen, P
    Jaumard, B
    de Aragao, MP
    Chauny, F
    Perron, S
    INTERNATIONAL JOURNAL OF APPROXIMATE REASONING, 2000, 24 (2-3) : 171 - 189
  • [36] A Refuted Conjecture on Probabilistic Satisfiability
    Finger, Marcelo
    De Bona, Glauber
    ADVANCES IN ARTIFICIAL INTELLIGENCE - SBIA 2010, 2010, 6404 : 293 - 302
  • [37] Easy cases of probabilistic satisfiability
    Andersen, KA
    Pretolani, D
    ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE, 2001, 33 (01) : 69 - 91
  • [38] On Probabilistic quantified satisfiability games
    Rychlik, M
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2003, PROCEEDINGS, 2003, 2747 : 652 - 661
  • [39] A New Branching Heuristic for Propositional Satisfiability
    Zhao, Yujuan
    Song, Zhenming
    2016 INTERNATIONAL CONFERENCE ON FUZZY THEORY AND ITS APPLICATIONS (IFUZZY), 2016,
  • [40] A Hybrid Method for Probabilistic Satisfiability
    Klinov, Pavel
    Parsia, Bijan
    AUTOMATED DEDUCTION - CADA-23, 2011, 6803 : 354 - 368
12345