Abstract
AbstractIn this paper we deal with the logical description of complexity classes arising in the real number model of computation introduced by Blum, Shub, and Smale [4]. We adapt the approach of descriptive complexity theory for this model developped in [14] and extend it to capture some further complexity classes over the reals by logical means. Among the latter we find NCℝ, PARℝ, EXPℝ and some others more.
Publisher
Cambridge University Press (CUP)
Reference25 articles.
1. On digital nondeterminism
2. Gross D. , Comptage sur les nombres réels, preprint. 1997.
3. On Relating Time and Space to Size and Depth
4. Generalized first-order spectra and polynomial-time recognizable sets;Fagin;SIAM-AMS Proceedings,1974
Cited by
16 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献