On oblivious branching programs of linear length

Authors:
Matthias Krause;Stephan Waack
Affiliations:
-;-
Venue:
Information and Computation
Year:
1991

Citing 0
Cited 6

Machine models and linear time complexity

ACM SIGACT News
Tradeoffs between Nondeterminism and Complexity for Communication Protocols and Branching Programs

STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
On relations between counting communication complexity classes

Journal of Computer and System Sciences
Nondeterministic ordered binary decision diagrams with repeated tests and various modes of acceptance

Information Processing Letters
On approximation by ⊕-OBDDs

Information Processing Letters
Nondeterministic ordered binary decision diagrams with repeated tests and various modes of acceptance

Information Processing Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract