Cargando…
Abstract recursion and intrinsic complexity
Presents a new framework for the complexity of algorithms, for all readers interested in the theory of computation.
Autor principal: | Moschovakis, Yiannis N |
---|---|
Lenguaje: | eng |
Publicado: |
Cambridge University Press
2018
|
Materias: | |
Acceso en línea: | http://cds.cern.ch/record/2667816 |
Ejemplares similares
-
On recursive relations and moment problems
por: El-Wahbi, B, et al.
Publicado: (2001) -
Three term recursion relation for spherical functions associated to the complex hyperbolic plane
por: Pacharoni, I, et al.
Publicado: (2004) -
Descriptive set theory
por: Moschovakis, Yiannis N
Publicado: (2014) -
Notes on set theory
por: Moschovakis, Yiannis N
Publicado: (1994) -
Logic from Computer Science : Proceedings of a Workshop
por: Moschovakis, Yiannis
Publicado: (1992)