Ditemukan 1 dokumen yang sesuai dengan query
Hartmanis, Juris
"
An overview of current developments in research on feasible computations; and a consideration of this area of research in relation to provable properties of complexity of computations.
The author begins by defining and discussing efficient reductions between problems and considers the families and corresponding complete languages of NL, DCSL, CSL, P, NP, PTAPE, EXPTIME, and EXPTAPE. Definitions and results are uniformly extended to computationally simpler natural families of languages such as NL, P, and CSL ...
"
Philadelphia: Society for Industrial and Applied Mathematics, 1989
e20448473
eBooks Universitas Indonesia Library
