Raymond Wu, Jie Lu
ITA Conference 2007
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 Wu, Jie Lu
ITA Conference 2007
Thomas R. Puzak, A. Hartstein, et al.
CF 2007
Charles H. Bennett, Aram W. Harrow, et al.
IEEE Trans. Inf. Theory
Maurice Hanan, Peter K. Wolff, et al.
DAC 1976