Picture 1 of 6
Gallery
Picture 1 of 6
Have one to sell?
Feasible Computations & Provable Complexity Properties #30, CBMS-NSF 1978
US $49.77
ApproximatelyS$ 64.14
Condition:
“1978. Vintage / Collectable Computer Science. PBK. Feasible Computations and Provable Complexity ”... Read moreabout condition
Good
A book that has been read but is in good condition. Very minimal damage to the cover including scuff marks, but no holes or tears. The dust jacket for hard covers may not be included. Binding has minimal wear. The majority of pages are undamaged with minimal creasing or tearing, minimal pencil underlining of text, no highlighting of text, no writing in margins. No missing pages.
Oops! Looks like we're having trouble connecting to our server.
Refresh your browser window to try again.
Shipping:
US $4.99 (approx S$ 6.43) USPS Media MailTM.
Located in: Chapel Hill, North Carolina, United States
Delivery:
Estimated between Wed, 27 Aug and Thu, 4 Sep to 94104
Returns:
30 days return. Buyer pays for return shipping. If you use an eBay shipping label, it will be deducted from your refund amount.
Coverage:
Read item description or contact seller for details. See all detailsSee all details on coverage
(Not eligible for eBay purchase protection programmes)
Seller assumes all responsibility for this listing.
eBay item number:116324207757
Item specifics
- Condition
- Good
- Seller Notes
- Topic
- computer science, applied mathematics, vintage computer books
- Vintage
- Yes
- Genre
- Computer & IT, computer science, Mathematics
- Features
- formulas, 1978, Out of Print
- Personalized
- No
- Edition
- First Edition
- Intended Audience
- Adults
- Narrative Type
- Nonfiction
- Inscribed
- No
- Personalize
- No
- Ex Libris
- No
- Era
- 1970s
- Book Series
- Society for Industrial and Applied Mathematics
- Signed
- Yes
- Original Language
- English
- Book Title
- Feasible Computations and Provable Complexity Properties (CBMS-NS
- Signed By
- Previous Owner
- ISBN
- 9780898710274
About this product
Product Identifiers
Publisher
Society for Industrial AND Applied Mathematics
ISBN-10
0898710278
ISBN-13
9780898710274
eBay Product ID (ePID)
740553
Product Key Features
Number of Pages
70 Pages
Language
English
Publication Name
Feasible Computations and Provable Complexity Properties
Subject
Machine Theory, General, Linguistics / General
Publication Year
1987
Type
Textbook
Subject Area
Computers, Language Arts & Disciplines
Series
Cbms-Nsf Regional Conference Series in Applied Mathematics Ser.
Format
Trade Paperback
Dimensions
Item Height
0.6 in
Item Weight
4.3 Oz
Item Length
9 in
Item Width
6 in
Additional Product Features
Intended Audience
Scholarly & Professional
Series Volume Number
No. 30
Table Of Content
Reductions and Complete Sets L-Isomorphisms of Complete Sets Structure of Complete Sets Long Proofs of Trivial Theorems What Can and Cannot Be Proven About Computational Complexity Relativized P NP Problem.
Synopsis
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. The concluding discussion is on the possibility that the famous P=NP? problem is independent of the axioms of formal mathematical systems such as set theory., Provides 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.
Item description from the seller
Seller feedback (385)
- e***i (407)- Feedback left by buyer.Past monthVerified purchaseFast service -- thank you
- 6***m (14)- Feedback left by buyer.Past monthVerified purchaseall good, thanks!
- 3***3 (217)- Feedback left by buyer.Past monthVerified purchaseSuper! Thank you!
Seller feedback (385)
- e***i (407)- Feedback left by buyer.Past monthVerified purchaseFast service -- thank you
- 6***m (14)- Feedback left by buyer.Past monthVerified purchaseall good, thanks!
- 3***3 (217)- Feedback left by buyer.Past monthVerified purchaseSuper! Thank you!