A Curious Algorithm
Zeke Zalcstein worked, before he retired a few years ago, on the boundary between mathematics and computational complexity. He started his career in mathematics, and then Zeke moved into computational complexity. His Ph.D. advisor was John Rhodes, who is an expert on many things, including the structure of semigroups; Rhodes has recently worked on the P=NP question himself.
KeywordsSpace Complexity Word Problem Faithful Representation Input Symbol Chinese Remainder Theorem
Unable to display preview. Download preview PDF.