An arithmetical characterization of NP
type: Item
instance of: scholarly article
title: An arithmetical characterization of NP
zbMATH Open document ID: 0498.03023
DOI: 10.1016/0304-3975(82)90076-7
author: Clement F. Kent
author: Bernard Hodgson
published in: Theoretical Computer Science
publication date: 1982-01-01T00:00:00Z
Mathematics Subject Classification ID: 03D15
Mathematics Subject Classification ID: 03D20
Mathematics Subject Classification ID: 03D25
zbMATH DE Number: 3784853
zbMATH Keywords: non-deterministic computability
zbMATH Keywords: arithmetical representability
zbMATH Keywords: non- deterministic Turing machine
zbMATH Keywords: universal quantifiers
zbMATH Keywords: existential quantifiers
zbMATH Keywords: quantifier prefix
MaRDI profile type: Publication
full work available at URL: 0304-3975(82)90076-7
OpenAlex ID: W2018323941
cites work: Q3247126
cites work: Q4198056
cites work: On the Product of the Primes
cites work: The bounded arithmetic hierarchy
cites work: Q4142699
cites work: Q5613949
cites work: The polynomial-time hierarchy
cites work: Complete sets and the polynomial-time hierarchy
description: scientific article; zbMATH DE number 3784853