On NP-completeness for linear machines
type: Item
instance of: scholarly article
title: On NP-completeness for linear machines
zbMATH Open document ID: 0888.68059
author: Christine Gaßner
published in: Journal of Complexity
publication date: 1997-10-01T00:00:00Z
Mathematics Subject Classification ID: 68Q15
Mathematics Subject Classification ID: 68Q05
zbMATH DE Number: 1069068
zbMATH Keywords: Blum-Shub-Smale model of computation
zbMATH Keywords: complexity classes
MaRDI profile type: Publication
full work available at URL: jcom.1997.0444
OpenAlex ID: W2156565475
cites work: On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
cites work: On digital nondeterminism
cites work: Separation of complexity classes in Koiran's weak model
cites work: Computing over the reals with addition and order
cites work: Real number models under various sets of operations
cites work: A survey on real structural complexity theory
cites work: Q4279733
DOI: 10.1006/JCOM.1997.0444
description: scientific article; zbMATH DE number 1069068