header
Local cover image
Local cover image
Image from OpenLibrary

Descriptive complexitics of syntactical fragments of programming languages / Soha Safwat Labib Hanna ; Supervised Ibrahim Farag , Wafik Boulos Lotfallah

By: Contributor(s): Material type: TextTextLanguage: English Publication details: Cairo : Soha Safwat Labib Hanna , 2012Description: 91 Leaves ; 30cmOther title:
  • التعقيدات الوصفية للعبارات التركيبية الخاصة بلغات البرمجة [Added title page title]
Subject(s): Online resources: Available additional physical forms:
  • Issued also as CD
Dissertation note: Thesis (Ph.D.) - Cairo University - Faculty of Computers and Information - Department of Computer Science Summary: Descriptive complexitics emerged from finite model theory and had its aims in finding logics that capture computational complexity classes. Observing that imperative programming languages can also be considered as logics (maybe with some additional control), we wxtend the scope of descriptive complexity by defining two fragments of such languages and showing that they capture the classes P and NP
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Home library Call number Copy number Status Barcode
Thesis Thesis قاعة الرسائل الجامعية - الدور الاول المكتبة المركزبة الجديدة - جامعة القاهرة Cai01.20.03.Ph.D.2012.So.D (Browse shelf(Opens below)) Not for loan 01010110058712000
CD - Rom CD - Rom مخـــزن الرســائل الجـــامعية - البدروم المكتبة المركزبة الجديدة - جامعة القاهرة Cai01.20.03.Ph.D.2012.So.D (Browse shelf(Opens below)) 58712.CD Not for loan 01020110058712000

Thesis (Ph.D.) - Cairo University - Faculty of Computers and Information - Department of Computer Science

Descriptive complexitics emerged from finite model theory and had its aims in finding logics that capture computational complexity classes. Observing that imperative programming languages can also be considered as logics (maybe with some additional control), we wxtend the scope of descriptive complexity by defining two fragments of such languages and showing that they capture the classes P and NP

Issued also as CD

There are no comments on this title.

to post a comment.

Click on an image to view it in the image viewer

Local cover image