Complexity Theoretical Results on Partitioned (Nondeterministic) Binary Decision Diagrams

Authors:
Beate Bollig;Ingo Wegener
Affiliations:
-;-
Venue:
MFCS '97 Proceedings of the 22nd International Symposium on Mathematical Foundations of Computer Science
Year:
1997

Citing 0
Cited 2

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
The computational complexity of equivalence and isomorphism problems

The computational complexity of equivalence and isomorphism problems

Quantified Score

Hi-index	0.00

Visualization

Abstract