Complexity classes and fragments of C
type: Item
instance of: scholarly article
title: Complexity classes and fragments of C
zbMATH Open document ID: 1178.68278
author: Lars Kristiansen
author: Paul J. Voda
published in: Information Processing Letters
publication date: 2009-07-09T00:00:00Z
Mathematics Subject Classification ID: 68Q15
Mathematics Subject Classification ID: 68N15
zbMATH DE Number: 5576896
zbMATH Keywords: complexity theory
zbMATH Keywords: programming languages
MaRDI profile type: Publication
full work available at URL: j.ipl.2003.08.010
OpenAlex ID: W2043509890
cites work: A new recursion-theoretic characterization of the polytime functions
cites work: Q4058132
cites work: Q4265595
cites work: LOGSPACE and PTIME characterized by programming languages
cites work: The expressive power of higher-order types or, life without CONS
DOI: 10.1016/J.IPL.2003.08.010
description: scientific article; zbMATH DE number 5576896