Academic Journal
Control structures in programs and computational complexity
| Τίτλος: | Control structures in programs and computational complexity |
|---|---|
| Συγγραφείς: | Karl-Heinz Niggl |
| Πηγή: | Annals of Pure and Applied Logic. 133:247-273 |
| Στοιχεία εκδότη: | Elsevier BV, 2005. |
| Έτος έκδοσης: | 2005 |
| Θεματικοί όροι: | Implicit computational complexity, Higher-type recursion, Logic, Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.), Theory of programming languages, 0102 computer and information sciences, 01 natural sciences, Recursive functions and relations, subrecursive hierarchies, Imperative programming languages, Polynomial time, Complexity classes (hierarchies, relations among complexity classes, etc.), 0101 mathematics, Functional programming and lambda calculus, Grzegorczyk hierarchy, Lambda calculus |
| Περιγραφή: | zbMATH Open Web Interface contents unavailable due to conflicting licenses. |
| Τύπος εγγράφου: | Article |
| Περιγραφή αρχείου: | application/xml |
| Γλώσσα: | English |
| ISSN: | 0168-0072 |
| DOI: | 10.1016/j.apal.2004.10.011 |
| Σύνδεσμος πρόσβασης: | https://zbmath.org/2160249 https://doi.org/10.1016/j.apal.2004.10.011 |
| Rights: | Elsevier Non-Commercial |
| Αριθμός Καταχώρησης: | edsair.doi.dedup.....614c86ecece6ea08b16eda773fb8b51a |
| Βάση Δεδομένων: | OpenAIRE |
| ISSN: | 01680072 |
|---|---|
| DOI: | 10.1016/j.apal.2004.10.011 |