P\(\neq\)NP over the nonstandard reals implies P\(\neq\)NP over \(\mathbb{R}\)
type: Item
instance of: scholarly article
title: P\(\neq\)NP over the nonstandard reals implies P\(\neq\)NP over \(\mathbb{R}\)
zbMATH Open document ID: 0822.68033
DOI: 10.1016/0304-3975(94)00067-0
author: Christian Michaux
published in: Theoretical Computer Science
publication date: 1995-10-09T00:00:00Z
Mathematics Subject Classification ID: 68Q15
Mathematics Subject Classification ID: 12L15
zbMATH DE Number: 695895
zbMATH Keywords: NP-complete problem
MaRDI profile type: Publication
full work available at URL: 0304-3975(94)00067-0
OpenAlex ID: W2050813033
cites work: An introduction to recursively saturated and resplendent models
cites work: On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
cites work: Model theory.
cites work: Algorithmic Procedures
cites work: Accessible telephone directories
cites work: On the use of inaccessible numbers and order indiscernibles in lower bound arguments for random access machines
cites work: Q4279733
cites work: On the computational complexity and geometry of the first-order theory of the reals. III: Quantifier elimination
cites work: Q5652669
cites work: Alfred Tarski's elimination theory for real closed fields
description: scientific article; zbMATH DE number 695895