Nanda Kambhatla
ACL 2004
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.
Nanda Kambhatla
ACL 2004
Beomseok Nam, Henrique Andrade, et al.
ACM/IEEE SC 2006
Ron Cytron, Jeanne Ferrante, et al.
POPL 1989
Chi-Leung Wong, Zehra Sura, et al.
I-SPAN 2002