Articoli correlati a Feasible Computations and Provable Complexity Properties
Sinossi
An overview of current developments in research on feasible computations; and its relation to provable properties of complexity of computations.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Descrizione del libro
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.
Contenuti
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.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
Risultati della ricerca per Feasible Computations and Provable Complexity Properties
Foto dell'editore
FEASIBLE COMPUTATIONS AND PROVABLE COMPLEXITY PROPERTIES.
Editore:
Society of Industrial and Applied Mathematics:, 1978
ISBN 10: 0898710278
ISBN 13: 9780898710274
Antico o usato
Soft Cover
Da: PASCALE'S BOOKS, NORTH READING, MA, U.S.A.
Valutazione del venditore 5 su 5 stelle
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. Codice articolo 022766
Compra usato
EUR 22,33
Spedizione EUR 4,77
Spedito in U.S.A.
Spedito in U.S.A.
Quantità: 1 disponibili
Immagini fornite dal venditore
Feasible Computations and Provable Complexity Properties (CBMS-NSF Regional Conference Series in Applied Mathematics, Series Number 30)
Editore:
Society for Industrial and Applied Mathematics, 1987
ISBN 10: 0898710278
ISBN 13: 9780898710274
Antico o usato
paperback
Prima edizione
Da: Coffee Cat Books, Chapel Hill, NC, U.S.A.
Valutazione del venditore 5 su 5 stelle
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 / 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. Codice articolo C0G091224G11
Compra usato
EUR 44,45
Spedizione gratuita
Spedito in U.S.A.
Spedito in U.S.A.
Quantità: 1 disponibili
Foto dell'editore
Feasible Computations and Provable Complexity Properties
Editore:
Society for Industrial and Applied Mathematics (SIAM), 1987
ISBN 10: 0898710278
ISBN 13: 9780898710274
Nuovo
PAP
Da: PBShop.store UK, Fairford, GLOS, Regno Unito
Valutazione del venditore 5 su 5 stelle
PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000. Codice articolo FW-9780898710274
Compra nuovo
EUR 49,11
Spedizione EUR 3,84
Spedito da Regno Unito a U.S.A.
Spedito da Regno Unito a U.S.A.
Quantità: 2 disponibili
Foto dell'editore
Feasible Computations and Provable Complexity Properties
Editore:
Society for Industrial and Applied Mathematics,U.S., US, 1987
ISBN 10: 0898710278
ISBN 13: 9780898710274
Nuovo
Paperback
Da: Rarewaves.com USA, London, LONDO, Regno Unito
Valutazione del venditore 5 su 5 stelle
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 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. Codice articolo LU-9780898710274
Compra nuovo
EUR 54,44
Spedizione gratuita
Spedito da Regno Unito a U.S.A.
Spedito da Regno Unito a U.S.A.
Quantità: 1 disponibili
Foto dell'editore
Feasible Computations and Provable Complexity Properties
Editore:
Society for Industrial & Applied, 1987
ISBN 10: 0898710278
ISBN 13: 9780898710274
Nuovo
Paperback
Da: Revaluation Books, Exeter, Regno Unito
Valutazione del venditore 5 su 5 stelle
Paperback. Condizione: Brand New. 70 pages. 10.00x7.00x0.25 inches. In Stock. Codice articolo __0898710278
Compra nuovo
EUR 47,41
Spedizione EUR 11,66
Spedito da Regno Unito a U.S.A.
Spedito da Regno Unito a U.S.A.
Quantità: 2 disponibili
Foto dell'editore
Feasible Computations and Provable Complexity Properties
Editore:
Society for Industrial & Applied Mathematics,U.S., 1987
ISBN 10: 0898710278
ISBN 13: 9780898710274
Nuovo
Paperback / softback
Da: THE SAINT BOOKSTORE, Southport, Regno Unito
Valutazione del venditore 5 su 5 stelle
Paperback / softback. Condizione: New. New copy - Usually dispatched within 4 working days. Codice articolo B9780898710274
Compra nuovo
EUR 58,19
Spedizione EUR 14,38
Spedito da Regno Unito a U.S.A.
Spedito da Regno Unito a U.S.A.
Quantità: 2 disponibili
Foto dell'editore
Feasible Computations and Provable Complexity Properties
Editore:
Society for Industrial and Applied Mathematics (SIAM), 1987
ISBN 10: 0898710278
ISBN 13: 9780898710274
Nuovo
Brossura
Da: Kennys Bookstore, Olney, MD, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New. 1987. paperback. . . . . . Books ship from the US and Ireland. Codice articolo V9780898710274
Compra nuovo
EUR 86,52
Spedizione EUR 9,10
Spedito in U.S.A.
Spedito in U.S.A.
Quantità: 1 disponibili
Foto dell'editore
Feasible Computations and Provable Complexity Properties
Editore:
Society for Industrial and Applied Mathematics (SIAM), 1987
ISBN 10: 0898710278
ISBN 13: 9780898710274
Nuovo
Brossura
Da: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlanda
Valutazione del venditore 5 su 5 stelle
Condizione: New. 1987. paperback. . . . . . Codice articolo V9780898710274
Compra nuovo
EUR 100,31
Spedizione EUR 9,50
Spedito da Irlanda a U.S.A.
Spedito da Irlanda a U.S.A.
Quantità: 1 disponibili
Foto dell'editore
Feasible Computations and Provable Complexity Properties
Editore:
Society for Industrial and Applied Mathematics,U.S., US, 1987
ISBN 10: 0898710278
ISBN 13: 9780898710274
Nuovo
Paperback
Da: Rarewaves.com UK, London, Regno Unito
Valutazione del venditore 5 su 5 stelle
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 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. Codice articolo LU-9780898710274
Compra nuovo
EUR 49,10
Spedizione EUR 75,81
Spedito da Regno Unito a U.S.A.
Spedito da Regno Unito a U.S.A.
Quantità: 1 disponibili
Foto dell'editore
Feasible Computations and Provable Complexity Properties (CBMS-NSF Regional Conference Series in Applied Mathematics, Series Number 30)
Editore:
Society for Industrial and Applied Mathematics, 1987
ISBN 10: 0898710278
ISBN 13: 9780898710274
Nuovo
Brossura
Da: SHIMEDIA, Brooklyn, NY, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New. Satisfaction Guaranteed or your money back. Codice articolo 0898710278
Compra nuovo
EUR 133,96
Spedizione gratuita
Spedito in U.S.A.
Spedito in U.S.A.
Quantità: 1 disponibili