A note on non-complete problems in NP_R
From MaRDI portal
Publication:1977151
Recommendations
Cites work
- scientific article; zbMATH DE number 1136078 (Why is no real title available?)
- scientific article; zbMATH DE number 953010 (Why is no real title available?)
- scientific article; zbMATH DE number 953024 (Why is no real title available?)
- scientific article; zbMATH DE number 781350 (Why is no real title available?)
- A uniform approach to obtain diagonal sets in complexity classes
- Accessible telephone directories
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
- On the Structure of $\cal NP_\Bbb C$
- On the Structure of Polynomial Time Reducibility
- P\(\neq\)NP over the nonstandard reals implies P\(\neq\)NP over \(\mathbb{R}\)
- Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question
- Saturation and stability in the theory of computation over the reals
- Two \(P\)-complete problems in the theory of the reals
Cited in
(9)- On Some $\mathcal{NP}$ -complete SEFE Problems
- Some initial thoughts on bounded query computations over the reals
- On Ladner's result for a class of real machines with restricted use of constants
- On Ladner's result for a class of real machines with restricted use of constants
- On Unapproximable Versions of $NP$-Complete Problems
- On strong NP-completeness of rational problems
- P\(\neq\)NP over the nonstandard reals implies P\(\neq\)NP over \(\mathbb{R}\)
- An explicit solution to Post's problem over the reals
- Some aspects of studying an optimization or decision problem in different computational models
This page was built for publication: A note on non-complete problems in \(NP_\mathbb{R}\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1977151)
