Hierarchy theorems for kOBDDs and kIBDDs
Authors:
- 28 September 1998
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 205 (1-2) , 45-60
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Simultaneous messages vs. communication1995
- On lower bounds for read-k-times branching programscomputational complexity, 1993
- Rounds in Communication Complexity RevisitedSIAM Journal on Computing, 1993
- Multiparty protocols, pseudorandom generators for logspace, and time-space trade-offsJournal of Computer and System Sciences, 1992
- Symbolic Boolean manipulation with ordered binary-decision diagramsACM Computing Surveys, 1992
- On oblivious branching programs of linear lengthInformation and Computation, 1991
- Lower bounds for depth-restricted branching programsInformation and Computation, 1991
- On different modes of communication1988
- Meanders, Ramsey theory and lower bounds for branching programs1986
- Graph-Based Algorithms for Boolean Function ManipulationIEEE Transactions on Computers, 1986