A lower bound for read-once-only branching programs

Authors:
László Babai;Péter Hajnal;Endre Szemerédi;Gyögy Turán
Affiliations:
Univ. of Chicago, Chicago, IL;Univ. of Chicago, Chicago, IL;Univ. of Chicago, Chicago, IL;Univ. of Chicago, Chicago, IL
Venue:
Journal of Computer and System Sciences
Year:
1987

A lower bound for integer multiplication with read-once branching programs

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Optimal Free Binary Decision Diagrams for Computation of EARn

MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Free binary decision diagrams for the computation of EARn

Computational Complexity
The computational complexity of equivalence and isomorphism problems

The computational complexity of equivalence and isomorphism problems

Hi-index	0.00