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: | |
---|---|
Lenguaje: | eng |
Publicado: |
Cambridge University Press
2018
|
Materias: | |
Acceso en línea: | http://cds.cern.ch/record/2667816 |
Sumario: | Presents a new framework for the complexity of algorithms, for all readers interested in the theory of computation. |
---|