Da
Reader's Corner, Inc., Raleigh, NC, U.S.A.
Valutazione del venditore 5 su 5 stelle
Heritage Bookseller
Membro AbeBooks dal 1996
This is a near fine trade paperback copy. #30 in the CBMS-NSF Regional Conference Series. Codice articolo 025609
An overview of current developments in research on feasible computations; and its relation to provable properties of complexity of computations.
Descrizione del libro: 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.
Titolo: Feasible Computations and Provable ...
Casa editrice: Society for Industrial & Applied, Philadelphia, Pennsylvania, U.S.A.
Data di pubblicazione: 1978
Legatura: Trade Paperback
Condizione: Near Fine
Condizione sovraccoperta: wraps
Edizione: First
Da: Coffee Cat Books, Chapel Hill, NC, U.S.A.
paperback. Condizione: GOOD. First Edition. 1978. Vintage / Collectable Computer Science. PBK. Feasible Computations and Provable Complexity Properties (CBMS-NSF Regional Conference Series in Applied Mathematics, Series Number 30). Society for Industrial and Applied Mathematics. Previous ownerâs name on title page. Text / formulas appear to be unmarked, no highlighting, underlining or writing. Softcover shows rubbing, corner creasing to back cover and some pages, edge and shelf wear from normal use. Binding is solid, square. Photos are of actual book you will receive. Ships quickly and with care. Codice articolo C0G091224G11
Quantità: 1 disponibili