Israel Cidon, Leonidas Georgiadis, et al.
IEEE/ACM Transactions on Networking
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.
Israel Cidon, Leonidas Georgiadis, et al.
IEEE/ACM Transactions on Networking
Arun Viswanathan, Nancy Feldman, et al.
IEEE Communications Magazine
Raymond Wu, Jie Lu
ITA Conference 2007
Rolf Clauberg
IBM J. Res. Dev