null
"synopsis" may belong to another edition of this title.
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.
"About this title" may belong to another edition of this title.
Seller: PASCALE'S BOOKS, NORTH READING, MA, U.S.A.
Soft Cover. Condition: 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. Seller Inventory # 022766
Seller: Coffee Cat Books, Chapel Hill, NC, U.S.A.
paperback. Condition: 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. Seller Inventory # C0G091224G11
Seller: SHIMEDIA, Brooklyn, NY, U.S.A.
Condition: New. Satisfaction Guaranteed or your money back. Seller Inventory # 0898710278