Equivalence of free boolean graphs can be decided probabilistically in polynomial time
- 18 March 1980
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 10 (2) , 80-82
- https://doi.org/10.1016/s0020-0190(80)90078-2
Abstract
No abstract availableKeywords
This publication has 2 references indexed in Scilit:
- Binary Decision DiagramsIEEE Transactions on Computers, 1978
- On Ianov's Program SchemataJournal of the ACM, 1964