Feasible Computations and Provable Complexity Properties (CBMS-NSF Regional Conference Series in Applied Mathematics, Series Number 30)

Language: English

Published by Society for Industrial and Applied Mathematics, 1987

0898710278 / 9780898710274

  • First Edition
  • Softcover
  • Used
See all details
Item image 1 of 5.

Seller: Coffee Cat Books, Chapel Hill, NC, U.S.A.Coffee Cat Books

5-star seller

AbeBooks seller since September 15, 2021

Softcover

Condition: Used - Good

US$ 49.77

US$ 5.99 shipping 
Ships within U.S.A.

Quantity: 1 available

Add to basket
Free 30-day returns

Item description from seller

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.…

Seller Inventory # C0G091224G11

Title
Feasible Computations and Provable Complexity Properties (CBMS-NSF Regional Conference Series in Applied Mathematics, Series Number 30)
Author
Hartmanis, Juris
Publisher
Society for Industrial and Applied Mathematics
Publication year
1987
Condition
GOOD
Binding
Softcover
Language
English
ISBN 10
0898710278
ISBN 13
9780898710274
Edition
First Edition.
Item weight
29 ounces
Dimensions
7x10
Seller catalogs
Computer Science, Mathematics, Science & Technology

Coffee Cat Books

Chapel Hill, NC, U.S.A.

5-star seller

AbeBooks seller since September 15, 2021

Shipping rates within U.S.A.

Item3 to 10 business days3 to 6 business days
First itemUS$ 5.99US$ 9.99
Delivery times are set by sellers and vary by carrier and location. Orders passing through Customs may face delays and buyers are responsible for any associated duties or fees. Sellers may contact you regarding additional charges to cover any increased costs to ship your items.

Payment methods

  • Visa
  • Mastercard
  • American Express
  • Apple Pay
  • Google Pay

Store description

Coffee Cat Books is a small family-owned business. We specialize in rare, out-of-print, and hard-to-find titles. Each book ships quickly and is packaged with care.

Specialty

nonfiction primarily