Raymond F. Boyce, Donald D. Chamberlin, et al.
CACM
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.
Raymond F. Boyce, Donald D. Chamberlin, et al.
CACM
Liat Ein-Dor, Y. Goldschmidt, et al.
IBM J. Res. Dev
Yvonne Anne Pignolet, Stefan Schmid, et al.
Discrete Mathematics and Theoretical Computer Science
Beomseok Nam, Henrique Andrade, et al.
ACM/IEEE SC 2006