Isbn: 9780898710274 - feasible computations and provable complexity problems (cbms-nsf regional conference applied mathematics) (3 Ergebnisse)

Soft Cover. Zustand: Fine. 62 pages. "The purpose of this monograph is to give an overview and a discussion of some recent results about computational complexity of feasible computations and the study of provable properties about complexity of computations." FINE SOFTCOVER. Size: 4to - over 9¾" - 12" tall. …

paperback. Zustand: 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. _____________________________________________________________________________________________________________________________ SYNOPSIS & HISTORY: 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 by using Log n-tape bounded reductions. The problem of determining what can and cannot be formally proven about running times of algorithms is discussed and related to the problem of establishing sharp time bounds for one-tape Turing machine computations, and the inability to formally prove running times for algorithms is then related to the presence of gaps in the hierarchy of complexity classes.…

Zustand: New. Satisfaction Guaranteed or your money back.