Storage requirements for deterministic polynomial time recognizable languages
type: Item
instance of: scholarly article
title: Storage requirements for deterministic polynomial time recognizable languages
zbMATH Open document ID: 0337.68031
DOI: 10.1016/S0022-0000(76)80048-7
author: Ravi Sethi
author: Stephen Cook
published in: Journal of Computer and System Sciences
publication date: 1976-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68N01
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 3527812
MaRDI profile type: Publication
cites work: Comparing complexity classes
cites work: An observation on time-storage trade off
cites work: Q4153609
cites work: Q5180413
cites work: Q4185781
cites work: Complete Register Allocation Problems
cites work: Characterization of flowchartable recursions
cites work: Recognition and parsing of context-free languages in time n3
description: scientific article; zbMATH DE number 3527812