Oliver Bodemer
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.
Oliver Bodemer
IBM J. Res. Dev
Pradip Bose
VTS 1998
Kafai Lai, Alan E. Rosenbluth, et al.
SPIE Advanced Lithography 2007
Donald Samuels, Ian Stobert
SPIE Photomask Technology + EUV Lithography 2007