The \(\mu\)-measure as a tool for classifying computational complexity
type: Item
instance of: scholarly article
title: The \(\mu\)-measure as a tool for classifying computational complexity
zbMATH Open document ID: 0964.03041
author: Karl-Heinz Niggl
published in: Archive for Mathematical Logic
publication date: 2001-07-16T00:00:00Z
Mathematics Subject Classification ID: 03D15
Mathematics Subject Classification ID: 03D20
Mathematics Subject Classification ID: 68Q15
Mathematics Subject Classification ID: 68Q42
zbMATH DE Number: 1547902
zbMATH Keywords: simply typed term systems
zbMATH Keywords: primitive recursive functions
zbMATH Keywords: computational complexity
zbMATH Keywords: Grzegorczyk classes
zbMATH Keywords: Heinermann class
zbMATH Keywords: polynomial time computable functions
MaRDI profile type: Publication
full work available at URL: s001530050163
OpenAlex ID: W2043102901
DOI: 10.1007/S001530050163
description: scientific article; zbMATH DE number 1547902