DESCRIPTIVE COMPLEXITICS OF SYNTACTICAL FRAGMENTS OF PROGRAMMING LANGUAGES
| Title: | DESCRIPTIVE COMPLEXITICS OF SYNTACTICAL FRAGMENTS OF PROGRAMMING LANGUAGES |
|---|---|
| Authors: | Labib Hanna, Soha Safwat |
| Source: | CU Theses; 2012 |
| Publisher Information: | Cairo University |
| Publication Year: | 2014 |
| Collection: | Cairo University E-Repository |
| Description: | 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 |
| Document Type: | article in journal/newspaper |
| Language: | English |
| Relation: | http://erepository.cu.edu.eg/index.php/cutheses/article/view/3472/3422; http://erepository.cu.edu.eg/index.php/cutheses/article/view/3472 |
| Availability: | http://erepository.cu.edu.eg/index.php/cutheses/article/view/3472 |
| Rights: | Copyright (c) 2025 CU Theses |
| Accession Number: | edsbas.276019F7 |
| Database: | BASE |