Gal Badishi, Idit Keidar, et al.
IEEE TDSC
Natural graphical representations for Boolean functions, so-called free Boolean graphs, arise in the study of Ianov schemes. Fortune, Hopcroft and Schmidt have asked if an algorithm can decide covalence of these free Boolean graphs in poly- time. We show that random polynomial time will suffice.
Gal Badishi, Idit Keidar, et al.
IEEE TDSC
B. Wagle
EJOR
Robert C. Durbeck
IEEE TACON
Chidanand Apté, Fred Damerau, et al.
ACM Transactions on Information Systems (TOIS)