About the Authors
Scott Aaronson
assistant professor
MIT, Cambridge, MA
aaronson[ta]csail[td]mit[td]edu
http://www.scottaaronson.com
assistant professor
MIT, Cambridge, MA
aaronson[ta]csail[td]mit[td]edu
http://www.scottaaronson.com
Scott Aaronson dropped out of Council Rock
High School in
Newtown, PA, before receiving a bachelor's degree from
Cornell
University and a Ph.D. from UC Berkeley. This is his
third paper in Theory of Computing.
Greg Kuperberg
professor
UC Davis, Davis, CA
greg[ta]math[td]ucdavis[td]edu
http://www.math.ucdavis.edu/~greg
professor
UC Davis, Davis, CA
greg[ta]math[td]ucdavis[td]edu
http://www.math.ucdavis.edu/~greg
Like Scott, Greg Kuperberg is also a high-school dropout.
He received a bachelor's degree from
Harvard University (1987) and a Ph.D.
in geometric topology and quantum algebra
from UC Berkeley (1991). His advisor was
Andrew Casson.
Both of his parents are mathematicians, and every subset of the
three have authored at least one paper, including the empty
subset if one allows other coauthors. He has
compiled a computer-assisted survey of complexity classes
called
``Complexity Zoology.''