Conference paper
Global routing revisited
Michael D. Moffitt
ICCAD 2009
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.
Michael D. Moffitt
ICCAD 2009
Beomseok Nam, Henrique Andrade, et al.
ACM/IEEE SC 2006
Elena Cabrio, Philipp Cimiano, et al.
CLEF 2013
Rajiv Ramaswami, Kumar N. Sivarajan
IEEE/ACM Transactions on Networking