Cargando…
Bounded queries in recursion theory
One of the major concerns of theoretical computer science is the classifi cation of problems in terms of how hard they are. The natural measure of difficulty of a function is the amount of time needed to compute it (as a function of the length of the input). Other resources, such as space, have als...
| Autores principales: | , |
|---|---|
| Lenguaje: | eng |
| Publicado: |
Springer
1999
|
| Materias: | |
| Acceso en línea: | https://dx.doi.org/10.1007/978-1-4612-0635-4 http://cds.cern.ch/record/2006126 |