The following pages link to Accessible telephone directories (Q4292595):
Displayed 15 items.
- A weak version of the Blum, Shub, and Smale model (Q676432) (← links)
- Real computational universality: the word problem for a class of groups with infinite presentation (Q734136) (← links)
- Universal resolution for NP-complete problems (Q1129008) (← links)
- Saturation and stability in the theory of computation over the reals (Q1304539) (← links)
- P\(\neq\)NP over the nonstandard reals implies P\(\neq\)NP over \(\mathbb{R}\) (Q1338220) (← links)
- Elimination of constants from machines over algebraically closed fields (Q1361877) (← links)
- Some aspects of studying an optimization or decision problem in different computational models (Q1848391) (← links)
- A note on non-complete problems in \(NP_\mathbb{R}\) (Q1977151) (← links)
- Computational complexity of multi-player evolutionarily stable strategies (Q2117070) (← links)
- \(\mathbf P =\mathbf{NP}\) for some structures over the binary words (Q2387422) (← links)
- Two situations with unit-cost: ordered abelian semi-groups and some commutative rings (Q2387423) (← links)
- On digital nondeterminism (Q4717055) (← links)
- Safe Recursion Over an Arbitrary Structure: PAR, PH and DPH (Q4916232) (← links)
- Algorithms yield upper bounds in differential algebra (Q5879624) (← links)
- Calculs sur les structures de langage dénombrable (Q5958306) (← links)