کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
10118892 | 1633561 | 2005 | 27 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Control structures in programs and computational complexity
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
منطق ریاضی
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Control structures in programs and computational complexity Control structures in programs and computational complexity](/preview/png/10118892.png)
چکیده انگلیسی
The present approach to analysing run time yields various characterisations of fptime and all Grzegorczyk classes at and above the flinspace level. Central to this approach is the distinction between “top recursion” and “side recursion”. Top recursions are the only form of recursion which can cause an increase in complexity. Counting the depth of nested top recursions leads to several versions of “the μ-measure”. In this way, various recent solutions of key problems in implicit complexity are integrated into a uniform approach.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Annals of Pure and Applied Logic - Volume 133, Issues 1â3, May 2005, Pages 247-273
Journal: Annals of Pure and Applied Logic - Volume 133, Issues 1â3, May 2005, Pages 247-273
نویسندگان
Karl-Heinz Niggl,