The maximum value problem and NP real numbers
type: Item
instance of: scholarly article
title: The maximum value problem and NP real numbers
zbMATH Open document ID: 0481.03038
DOI: 10.1016/0022-0000(82)90053-8
published in: Journal of Computer and System Sciences
publication date: 1982-01-01T00:00:00Z
Mathematics Subject Classification ID: 03F60
Mathematics Subject Classification ID: 03D60
Mathematics Subject Classification ID: 03D15
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 3754685
zbMATH Keywords: NP computable real number
zbMATH Keywords: maximum value of a continuous polynomial time computable real function
zbMATH Keywords: NP sets over a single-letter alphabet
author: Ker-I Ko
MaRDI profile type: Publication
full work available at URL: 0022-0000(82)90053-8
OpenAlex ID: W2004966370
cites work: Q4160434
cites work: Q4138187
cites work: Q3260573
cites work: Q4122837
cites work: Computational complexity of real functions
cites work: On the definitions of some complexity classes of real numbers
cites work: On the Structure of Polynomial Time Reducibility
cites work: Toward Abstract Numerical Analysis
cites work: Q5573961
cites work: Nicht konstruktiv beweisbare Sätze der Analysis
cites work: The polynomial-time hierarchy
description: scientific article; zbMATH DE number 3754685