Efficient Reducibility Between Programming Systems: Preliminary Report (1977)
by
Nancy A. Lynch
,
Edward K. Blum
| Citations: | 3 - 0 self |
BibTeX
@MISC{Lynch77efficientreducibility,
author = {Nancy A. Lynch and Edward K. Blum},
title = {Efficient Reducibility Between Programming Systems: Preliminary Report },
year = {1977}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Citations
| 2172 | The Design and Analysis of Computer Algorithms - Aho, Hopcroft, et al. - 1974 |
| 70 | Heterogeneous algebras - Birkhoff, Lipson - 1970 |
| 51 | Specification Techniques for Data Abstraction - Liskov, Zilles - 1975 |
| 45 | Monadic computation and iterative algebraic theories - Elgot - 1975 |
| 41 | Comparison of polynomial-time reducibilities - Ladner, Lynch, et al. - 1975 |
| 36 | Comparative schematology - PATERSON, HEWITT - 1970 |
| 28 | The Complexity of Theorem–Proving - Cook - 1971 |
| 8 | A junction between computer science and category theory I (part I), IBM research report RC - GOGN, THATCHER, et al. |
| 2 | The Algebraic Theory of Recursive Program Schemes, Symposium on Category Theory Applied to Computation and Control - Burstall, Thatcher |
| 1 | On Formalised Computer Programs - Paterson - 1970 |
| 1 | Program Schemes, Recursion Schemes and Form Formal Languages - Garland, Luckham - 1973 |
