Paper
The Qx-coder
M.J. Slattery, Joan L. Mitchell
IBM J. Res. Dev
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.
M.J. Slattery, Joan L. Mitchell
IBM J. Res. Dev
Mark N. Wegman
POPL 1983
Robert C. Durbeck
IEEE TACON
Kafai Lai, Alan E. Rosenbluth, et al.
SPIE Advanced Lithography 2007