9780898710274 - feasible computations and provable complexity properties di hartmanis, juris (10 risultati)
Lingua: Inglese
Editore: Society of Industrial and Applied Mathematics:, 1978
- Brossura
Da: PASCALE'S BOOKS, NORTH READING, MA, U.S.A.PASCALE'S BOOKS
Contatta il venditoreVenditore con 5 stelleCondizione: Usato - Ottimo
EUR 22,62
EUR 4,83 spedizioneSpedito in U.S.A.Quantità: 1 disponibili
Soft Cover. Condizione: 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.
- Altre immagini
Lingua: Inglese
Editore: Society for Industrial and Applied Mathematics, 1987
- Brossura
- Prima edizione
Da: Coffee Cat Books, Chapel Hill, NC, U.S.A.Coffee Cat Books
Contatta il venditoreVenditore con 5 stelleCondizione: Usato - Buono
EUR 45,02
Spedizione gratuitaSpedito in U.S.A.Quantità: 1 disponibili
paperback. Condizione: 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 / formul…as 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.
Lingua: Inglese
Editore: Society for Industrial and Applied Mathematics (SIAM), 1987
- Brossura
Da: PBShop.store UK, Fairford, GLOS, Regno UnitoPBShop.store UK
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 49,14
EUR 3,84 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 2 disponibili
PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000.
Lingua: Inglese
Editore: Society for Industrial and Applied Mathematics,U.S., US, 1987
- Brossura
Da: Rarewaves.com USA, London, LONDO, Regno UnitoRarewaves.com USA
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 54,57
Spedizione gratuitaSpedito da Regno Unito a U.S.A.Quantità: 1 disponibili
Paperback. Condizione: New. 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 corr…esponding 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.
- Brossura
Da: Revaluation Books, Exeter, Regno UnitoRevaluation Books
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 47,43
EUR 11,67 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 2 disponibili
Paperback. Condizione: Brand New. 70 pages. 10.00x7.00x0.25 inches. In Stock.
Lingua: Inglese
Editore: Society for Industrial & Applied Mathematics,U.S., 1987
- Brossura
Da: THE SAINT BOOKSTORE, Southport, Regno UnitoTHE SAINT BOOKSTORE
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 58,22
EUR 14,39 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 2 disponibili
Paperback / softback. Condizione: New. New copy - Usually dispatched within 4 working days.
Lingua: Inglese
Editore: Society for Industrial and Applied Mathematics (SIAM), 1987
- Brossura
Da: Kennys Bookstore, Olney, MD, U.S.A.Kennys Bookstore
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 87,63
EUR 9,22 spedizioneSpedito in U.S.A.Quantità: 1 disponibili
Condizione: New. 1987. paperback. . . . . . Books ship from the US and Ireland.
Lingua: Inglese
Editore: Society for Industrial and Applied Mathematics (SIAM), 1987
- Brossura
Da: Kennys Bookshop and Art Galleries Ltd., Galway, GY, IrlandaKennys Bookshop and Art Galleries Ltd.
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 100,31
EUR 9,50 spedizioneSpedito da Irlanda a U.S.A.Quantità: 1 disponibili
Condizione: New. 1987. paperback. . . . . .
Lingua: Inglese
Editore: Society for Industrial and Applied Mathematics,U.S., US, 1987
- Brossura
Da: Rarewaves.com UK, London, Regno UnitoRarewaves.com UK
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 49,13
EUR 75,85 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 1 disponibili
Paperback. Condizione: New. 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 corr…esponding 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.
Lingua: Inglese
Editore: Society for Industrial and Applied Mathematics, 1987
- Brossura
Da: SHIMEDIA, Brooklyn, NY, U.S.A.SHIMEDIA
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 135,68
Spedizione gratuitaSpedito in U.S.A.Quantità: 1 disponibili
Condizione: New. Satisfaction Guaranteed or your money back.
