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
Immagini fornite dal venditore
Feasible Computations and Provable Complexity Properties
Editore:
Society for Industrial and Applied Mathematics, Philadelphia, 1978
ISBN 10: 0898710278
ISBN 13: 9780898710274
Antico o usato
Softcover
Da: Fox & Hedgehog, Moraga, CA, U.S.A.
Valutazione del venditore 5 su 5 stelle
Softcover. Condizione: Very Good+. (NAP). Binding tight, spine uncreased. No marks. Minor wear to sunned covers. Codice articolo 218
Compra usato
EUR 18,56
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 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,10
Spedizione EUR 4,72
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 43,99
Spedizione gratuita
Spedito in U.S.A.
Spedito in 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 132,58
Spedizione gratuita
Spedito in U.S.A.
Spedito in U.S.A.
Quantità: 1 disponibili