Complexity classes and fragments of C

DOI10.1016/j.ipl.2003.08.010zbMath1178.68278OpenAlexW2043509890MaRDI QIDQ1029017

Paul J. Voda, Lars Kristiansen

Publication date: 9 July 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2003.08.010

zbMATH Keywords

programming languagescomplexity theory

Mathematics Subject Classification ID

Theory of programming languages (68N15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (5)

A Characterisation of the Relations Definable in Presburger Arithmetic ⋮ Pure Iteration and Periodicity ⋮ Recursion in Higher Types and Resource Bounded Turing Machines ⋮ Bounded minimalisation and bounded counting in argument-bounded idc's ⋮ Complexity-theoretic hierarchies induced by fragments of Gödel's \(T\)

Cites Work

• A new recursion-theoretic characterization of the polytime functions
• LOGSPACE and PTIME characterized by programming languages
• The expressive power of higher-order types or, life without CONS
• Unnamed Item
• Unnamed Item

This page was built for publication: Complexity classes and fragments of C