Foto 1 di 6
Galleria
Foto 1 di 6
Feasible Computations & Provable Complexity Properties #30, CBMS-NSF 1978
US $49,77
CircaEUR 44,89
Condizione:
“1978. Vintage / Collectable Computer Science. PBK. Feasible Computations and Provable Complexity ”... Ulteriori informazioniinformazioni sulla condizione
Buone condizioni
Libro che è già stato letto ma è in buone condizioni. Mostra piccolissimi danni alla copertina incluse alcune rigature, ma nessun foro o strappo. È possibile che la sovraccoperta per le copertine rigide non sia inclusa. La rilegatura presenta minimi segni di usura. La maggior parte delle pagine non è danneggiata e mostra una quantità minima di piegature o strappi, sottolineature di testo a matita, nessuna evidenziazione di testo né scritte ai margini. Non ci sono pagine mancanti. Per maggiori dettagli e la descrizione di eventuali imperfezioni, consulta l'inserzione del venditore.
- Compralo SubitoFeasible Computations & Provable Complexity Properties #30, CBMS-NSF 1978
Oops! Looks like we're having trouble connecting to our server.
Refresh your browser window to try again.
Spedizione:
US $9,95 (circa EUR 8,97) USPS Priority Mail®.
Oggetto che si trova a: Chapel Hill, North Carolina, Stati Uniti
Consegna:
Consegna prevista tra il gio 15 mag e il lun 19 mag a 43230
Restituzioni:
Restituzioni entro 30 giorni. Le spese di spedizione del reso sono a carico dell'acquirente..
Pagamenti:
Fai shopping in tutta sicurezza
Il venditore si assume la piena responsabilità della messa in vendita dell'oggetto.
Numero oggetto eBay:116324207757
Specifiche dell'oggetto
- Condizione
- Buone condizioni
- Note del venditore
- 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
Informazioni su questo prodotto
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
Publication Name
Feasible Computations and Provable Complexity Properties
Language
English
Publication Year
1987
Subject
Machine Theory, General, Linguistics / General
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.
Descrizione dell'oggetto fatta dal venditore
Informazioni sul venditore professionale
Informazioni su questo venditore
PorterMonkeyBooks
100% di Feedback positivi•1,3 mila oggetti venduti
Registrato come venditore professionale
Feedback sul venditore (369)
- *****- Feedback lasciato dall'acquirente.Ultimi 6 mesiAcquisto verificatoWow....hard to find item, in perfect condition, sent quickly with excellent packaging and communication, for a very reasonable price. What's not to like!! Excellent seller. I recommend them without reservation. To the seller, thank you very much.
- g***- (33)- Feedback lasciato dall'acquirente.Mese scorsoAcquisto verificatoWas replacing my wife’s water damaged Bible: this was the exact one! Fair price, perfect condition/as described, fast shipping, well packaged… no complaints. Thank you!
- m***r (376)- Feedback lasciato dall'acquirente.Mese scorsoAcquisto verificatoAccurate description great packaging fast shipping, thanks!
PorterMonkeyBooks
100% di Feedback positivi•1,3 mila oggetti venduti
Registrato come venditore professionale
Feedback sul venditore (369)
- *****- Feedback lasciato dall'acquirente.Ultimi 6 mesiAcquisto verificatoWow....hard to find item, in perfect condition, sent quickly with excellent packaging and communication, for a very reasonable price. What's not to like!! Excellent seller. I recommend them without reservation. To the seller, thank you very much.
- g***- (33)- Feedback lasciato dall'acquirente.Mese scorsoAcquisto verificatoWas replacing my wife’s water damaged Bible: this was the exact one! Fair price, perfect condition/as described, fast shipping, well packaged… no complaints. Thank you!
- m***r (376)- Feedback lasciato dall'acquirente.Mese scorsoAcquisto verificatoAccurate description great packaging fast shipping, thanks!