758624
9780898710274
Out of Stock
The item you're looking for is currently unavailable.
An overview of current developments in research on feasible computations. Defines and discusses efficient reductions between problems and considers the families and corresponding complete languages of NL, DCSL, CSL, P, NP, PTAPE, EXPTIME, and EXPTAPE.Hartmanis, Juris is the author of 'Feasible Computations and Provable Complexity Problems' with ISBN 9780898710274 and ISBN 0898710278.
[read more]