Journal of the ACM Bibliography
Ingo Wegener. On the complexity of
branching programs and decision trees for clique functions.
Journal of the ACM, 35(2):461-471, April 1988.
[BibTeX entry]
Selected papers that cite this one
- Henrik Reif Andersen and Henrik Hulgaard. Boolean expression
diagrams (extended abstract). In Proceedings, Twelth Annual
IEEE Symposium on Logic in Computer Science, pages 88-98, Warsaw,
Poland, 29 June-2 July 1997. IEEE Computer Society Press.
- Beate Bollig, Martin Sauerhoff, Detlef Sieling, and Ingo Wegener. Hierarchy
theorems for kOBDDs and kIBDDs.
Theoretical Computer Science, 205(1-2):45-60, 28 September
1998.
- Anna Gál. A
simple function that requires exponential size read-once branching
programs. Information Processing Letters, 62(1):13-16,
14 April 1997.
- C. Meinel and S. Waack. Separating complexity
classes related to bounded alternating omega-branching programs.
Mathematical Systems Theory, 28(1):21-39, January/February
1995.
- Stephen Ponzio. A
lower bound for integer multiplication with read-once branching
programs. In Proceedings of the Twenty-Seventh Annual ACM
Symposium on the Theory of Computing, pages 130-139, Las Vegas,
Nevada, 29 May-1 June 1995.
- Petr Savický and Stanislav \v{Z}ák. A lower bound on
branching programs reading some bits twice. Theoretical
Computer Science, 172(1-2):293-301, 10 February 1997. Note.
- Detlef Sieling. New lower bounds and
hierarchy results for restricted branching programs. Journal
of Computer and System Sciences, 53(1):79-87, August 1996.
Shortcuts: