Conference paper
Patterning of highly conducting polyaniline films
T. Graham, A. Afzali, et al.
Microlithography 2000
Paper
A search procedure and lower bound for odd perfect numbers
Abstract
An infinite tree-generating “q-algorithm” is defined, which if executed would enumerate all odd perfect numbers (opn’s). A truncated execution shows that any opn has either some component pa > 1018, with a even, or no divisor < 7; hence any opn must be > 1036. © 1973, American Mathematical Society.
Related
Conference paper
Isotropic treatment of EMF effects in advanced photomasks
Jaione Tirapu Azpiroz, Alan E. Rosenbluth, et al.
SPIE Photomask Technology + EUV Lithography 2009
Hans Becker, Frank Schmidt, et al.
Photomask and Next-Generation Lithography Mask Technology 2004
Donald Samuels, Ian Stobert
SPIE Photomask Technology + EUV Lithography 2007