Complete problems for deterministic polynomial time
type: Item
instance of: scholarly article
title: Complete problems for deterministic polynomial time
zbMATH Open document ID: 0352.68068
DOI: 10.1016/0304-3975(76)90068-2
author: Neil D. Jones
author: William T. Laaser
published in: Theoretical Computer Science
publication date: 1977-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68W99
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 3548437
MaRDI profile type: Publication
full work available at URL: 0304-3975(76)90068-2
OpenAlex ID: W1999647826
cites work: Q5679729
cites work: The complexity of theorem-proving procedures
cites work: An observation on time-storage trade off
cites work: Unit Refutations and Horn Sets
cites work: Q5592246
cites work: Space-bounded reducibility among combinatorial problems
cites work: Q4142699
cites work: Q4131648
cites work: Recognition and parsing of context-free languages in time n3
description: scientific article; zbMATH DE number 3548437