Comparative schematology and pebbling with auxiliary pushdowns (Preliminary Version)

Nicholas Pippenger
1980 Proceedings of the twelfth annual ACM symposium on Theory of computing - STOC '80  
This paper has three claims to interest. First, it combines comparative schematology with complexity theory. This combination is capable of distinguishing among Strong's "languages of maximal power," a distinction not possible when comparative schematology is based on computability considerations alone, and it is capable of establishing exponential disparities in running times, a capability not currently possessed by complexity theory alone. Secondly, this paper inaugurates the study of
more » ... he study of pebbling with auxiliary pushdowns, which bears to plain pebbling the same relationship as Cook's study of space-bounded machines with auxiliary pushdowns bears to plain space-bounded machines. This extension of pebbling serves as the key to the problems of comparative schematology mentioned above. Finally, this paper advantageously displays the virtues of recent work by Gabber and Galil giving explicit constructions for certain graphs, for the availability of such explicit constructions is essential to the results of this paper.
doi:10.1145/800141.804684 dblp:conf/stoc/Pippenger80 fatcat:r4aptr2wuzhuje4evt65s47ku4