On the Computational Complexity of Program Schemata
| dc.contributor.author | Weihrauch, K. | en_US |
| dc.date.accessioned | 2007-04-19T19:07:22Z | |
| dc.date.available | 2007-04-19T19:07:22Z | |
| dc.date.issued | 1974-02 | en_US |
| dc.description.abstract | An ordering called "faster" is defined on the class of iterative program schemata. It is in good accordance with the intuition of "better" applied to program schemata. Many of the commonly used optimization techniques yield "faster" programs in this sense. For Ianov schemata the relation "faster" is decidable, but even on strong equivalence classes the ordering may be very complicated. For iterative program schemata there is a certain kind of speedup. Whereas there is an arbitrary slowdown for programs, slowdown for program schemata is limited. | en_US |
| dc.format.extent | 1708668 bytes | |
| dc.format.extent | 452850 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.format.mimetype | application/postscript | |
| dc.identifier.citation | http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR74-196 | en_US |
| dc.identifier.uri | https://hdl.handle.net/1813/6036 | |
| dc.language.iso | en_US | en_US |
| dc.publisher | Cornell University | en_US |
| dc.subject | computer science | en_US |
| dc.subject | technical report | en_US |
| dc.title | On the Computational Complexity of Program Schemata | en_US |
| dc.type | technical report | en_US |