Pages that link to "Item:Q1338220"

The following pages link to P\(\neq\)NP over the nonstandard reals implies P\(\neq\)NP over \(\mathbb{R}\) (Q1338220):

Displaying 12 items.

• On Ladner's result for a class of real machines with restricted use of constants (Q418114) (← links)
• Saturation and stability in the theory of computation over the reals (Q1304539) (← links)
• On sparseness, reducibilities, and complexity (Q1779309) (← links)
• Some aspects of studying an optimization or decision problem in different computational models (Q1848391) (← links)
• On the P-NP problem over real matrix rings (Q1884926) (← links)
• A note on non-complete problems in \(NP_\mathbb{R}\) (Q1977151) (← links)
• Two situations with unit-cost: ordered abelian semi-groups and some commutative rings (Q2387423) (← links)
• The P\(\neq\) NP conjecture in the context of real and complex analysis (Q2489146) (← links)
• On Ladner’s Result for a Class of Real Machines with Restricted Use of Constants (Q3576067) (← links)
• \(\text{P}\neq \text{NP}\) for the reals with various analytic functions (Q5938579) (← links)
• On a transfer theorem for the \(\text{P}\neq \text{NP}\) conjecture (Q5938580) (← links)
• Calculs sur les structures de langage dénombrable (Q5958306) (← links)