The satisfiability problem for probabilistic ordered branching programs

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 1998, Pages 81-91

  Agrawal, M ^a   Thierauf, T ^b  

^a INDIAN INSTITUTE OF TECHNOLOGY KANPUR   (India)

^b UNIVERSITY OF ULM   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; ERRORS; POLYNOMIAL APPROXIMATION;

BOUNDED ERRORS; BRANCHING PROGRAMS; NP COMPLETE; POLYNOMIAL-TIME ALGORITHMS; SATISFIABILITY PROBLEMS;

FORMAL LOGIC;

EID: 84957096709     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CCC.1998.694593     Document Type: Conference Paper

References (21)

1. [Abl97] F. Ablayev. Randomization and nondeterminism are incomparable for ordered read-once branching programs. In 24rd International Colloquium on Automata Languages and Programming, Lecture Notes in Computer Science 1256, pages 195-202. Springer-Verlag, 1997.
2. [AK96] F. Ablayev and M. Karpinski. On the power of randomized branching programs. In 23rd International Colloquium on Automata Languages and Programming, Lecture Notes in Computer Science 1099, pages 348-356. Springer-Verlag, 1996.
3. [AK98] F. Ablayev and M. Karpinski. A lower bound for integer multiplication on randomized read-once branching programs. Technical Report TR98-011, Electronic Colloquium on Computational Complexity, http://www.eccc.uni-trier.de/eccc/, 1998.
4. [BHR95] Y. Breitbart, H. Hunt, and D. Rosenkrantz. On the size of binary decision diagrams representing Boolean functions. Theoretical Computer Science, 145:45-69, 1995.
5. [BRS93] A. Borodin, A. Razborov, and R. Smolensky. On lower bounds for read-k-times branching programs. Computational Complexity, 3:1-18, 1993.
6. [Bry86] R. Bryant. Graph-based algorithms for Boolean function manipulation. IEEE Transaction on Computers, 35(6):677-691, 1986.
7. [Bry91] R. Bryant. On the complexity of VLSI implementations and graph representation of Boolean functions with applications to integer multiplication. IEEE Transaction on Computers, 40(2):205-213, 1991.
8. [Bry92] R. Bryant. Symbolic Boolean manipulation with ordered binary-decision diagrams. ACM Computing Surveys, 24(3):293-318, 1992.
9. [BS90] R. Boppana and M. Sipser. The complexity of finite functions. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science. The MIT Press and Elsevier, 1990.
10. [BSSW94] B. Bollig, M. Sauerhoff, D. Sieling, and I. Wegener. On the power of different types of restricted branching programs. Technical Report TR94-026, Electronic Colloquium on Computational Complexity, http://www.eccc.uni-trier.de/eccc/, 1994. To appear in Theoretical Computer Science with new title: Hierarchy Theorems for k-OBDDs and k-IBDDs.
11. [GM96] J. Gergov and C. Meinel. Mod-2-OBDDs - a data structure that generalizes EXORsum-of-products and odered binary decision diagrams. Formal Methods in System Design, 8:273-282, 1996.
12. [Grü67] B. Grünbaum. Convex Polytopes. Interscience Publishers (John Wiley & Sons), 1967.
13. [Juk89] S. Jukna. The effect of null-chains on the complexity of contact schemes. In 7th Fundamentals of Computation Theory, Lecture Notes in Computer Science 380, pages 246-256. Springer-Verlag, 1989.
14. [Kha79] L. Khachian. A polynomial algorithm in linear programming. Russian Academy of Sciences Doklady. Mathematics (formerly Soviet Mathematics-Doklady), 20:191-194, 1979.
15. [KMW91] M. Krause, C. Meinel, and S. Waack. Separating the eraser Turing machine classes Le, NLe, and Pe. Theoretical Computer Science, 86:267-275, 1991.
16. [MA78] K. Manders and L. Adleman. NP-complete decision problems for binary quadratics. Journal of Computer and System Sciences, 16:168-184, 1978.
17. [Mas76] W. Masek. A fast algorithm for the string editing problem and decision graphs complexity. Master's thesis, Massachusetts Institute of Technology, 1976.
18. [Pon95] S. Ponzio. Restricted Branching Programs and Hardware Verification. PhD thesis, Massachusetts Institute of Technology, 1995.
19. [Sau97] M. Sauerhoff. A lower bound for randomized read-k-times branching programs. Technical Report TR97-019, Electronic Colloquium on Computational Complexity, http://www.eccc.uni-trier.de/eccc/, 1997.
20. [Waa97] S. Waack. On the descriptive and algorithmic power of parity ordered binary decision diagrams. In 14th Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science 1200, pages 201-212. Springer-Verlag, 1997.
21. [Weg88] I. Wegener. On the complexity of branching programs and decision trees for clique functions. Journal of the ACM, 35:461-471, 1988.