Filters








3 Hits in 2.5 sec

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  
Secondly, this paper inaugurates the 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  ...  First, it combines comparative schematology with complexity theory.  ...  Acknowledgment I am indebted to Hector Levesque, who asked how coroutines were more powerful than subroutines, and to Charles Raekoff, who pointed out the inadequacy of the traditional schematological  ... 
doi:10.1145/800141.804684 dblp:conf/stoc/Pippenger80 fatcat:r4aptr2wuzhuje4evt65s47ku4

Page 4231 of Mathematical Reviews Vol. , Issue 81J [page]

1981 Mathematical Reviews  
. 333-338); Joseph Ja’Ja’, Time-space tradeoffs for some algebraic problems (pp. 339- 350); Nicholas Pippenger, Comparative schematology and peb- bling with auxiliary pushdowns (preliminary version) (pp  ...  (preliminary version) (pp. 58-69). Session II: Nancy A.  ... 

Pebbling with an auxiliary pushdown

Nicholas Pippenger
1981 Journal of computer and system sciences (Print)  
The worst-case time-space trade-off for pebbling with an auxiliary pushdown is shown to be T = N exp @(N/S) (where T denotes time, S denotes space and N denotes the size of the graph), which contrasts  ...  A pebble game on graphs is introduced which bears the same relationship to the ordinary pebble game as auxiliary pushdown machines bear to ordinary machines.  ...  The auxiliary-pushdown pebble game also has applications in comparative schematology, one of which was discussed in a preliminary version [ 141 of this paper.  ... 
doi:10.1016/0022-0000(81)90011-8 fatcat:xqtmjopnk5havbok67dgye6j4u