Articoli correlati a Modified Branching Programs and Their Computational...
Sinossi
Branching Programs are, besides Boolean circuits, the most important nonuniform model of computation. This volume gives a survey of the latest research in this field. It presents a branching program-based approach to complexity theory. Starting with a definition of branching programs and a review of the former research, nondeterministic branching programs are introduced and investigated, thus allowing the description of some fundamental complexity classes. The book then concentrates on the new concept of Omega-branching programs. Apart from the usual binary tests they contain features for evaluating certain elementary Boolean functions and are suited for characterizing space-bounded complexity classes. By means of these characterizations the author demonstrates the separation of some restricted complexity classes. In the appendix a number of extremely restricted graph-accessibility problems are given, which are, due to the branching program descriptions in chapters 1-3, p-projection complete in the classes under consideration.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Contenuti
Preliminaries.- Branching programs and their computational power.- Nondeterministic branching programs.- ?=branching programs and theirs computational power.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
- EditoreSpringer
- Data di pubblicazione2008
- ISBN 10 354051340X
- ISBN 13 9783540513407
- RilegaturaCopertina flessibile
- LinguaInglese
- Numero di pagine144
- Contatto del produttorenon disponibile
Compra nuovo
Visualizza questo articolo
EUR 48,37
EUR 9,70 per la spedizione da Germania a Italia
Destinazione, tempi e costi
Risultati della ricerca per Modified Branching Programs and Their Computational...
Immagini fornite dal venditore
Modified branching programs and their computational power. Lecture notes in computer science ; 370
ISBN 10: 354051340X
ISBN 13: 9783540513407
Antico o usato
Brossura
Da: Antiquariat Bookfarm, Löbnitz, Germania
Valutazione del venditore 5 su 5 stelle
VI, 132 pages Ex-Library book in good condition. 9783540513407 Sprache: Englisch Gewicht in Gramm: 440. Codice articolo 1166259
Quantità: 1 disponibili
Foto dell'editore
Modified Branching Programs and Their Computational Power
Editore:
Springer Berlin / Heidelberg, 1989
ISBN 10: 354051340X
ISBN 13: 9783540513407
Antico o usato
Brossura
Da: Better World Books Ltd, Dunfermline, Regno Unito
Valutazione del venditore 5 su 5 stelle
Condizione: Very Good. Ships from the UK. Former library book; may include library markings. Used book that is in excellent condition. May show signs of wear or have minor defects. Codice articolo 50372778-20
Quantità: 1 disponibili
Foto dell'editore
Modified Branching Programs and Their Computational Power
Editore:
Springer Berlin / Heidelberg, 1989
ISBN 10: 354051340X
ISBN 13: 9783540513407
Antico o usato
Brossura
Da: Better World Books: West, Reno, NV, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: Very Good. Former library book; may include library markings. Used book that is in excellent condition. May show signs of wear or have minor defects. Codice articolo 50372778-20
Quantità: 1 disponibili
Immagini fornite dal venditore
Modified Branching Programs and Their Computational Power
Print on DemandDa: moluna, Greven, Germania
Valutazione del venditore 5 su 5 stelle
Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Branching Programs are, besides Boolean circuits, the most important nonuniform model of computation. This volume gives a survey of the latest research in this field. It presents a branching program-based approach to complexity theory. Starting with a defin. Codice articolo 4891925
Quantità: Più di 20 disponibili
Immagini fornite dal venditore
Modified Branching Programs and Their Computational Power
Editore:
Springer Berlin Heidelberg, 1989
ISBN 10: 354051340X
ISBN 13: 9783540513407
Nuovo
Taschenbuch
Da: AHA-BUCH GmbH, Einbeck, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - Branching Programs are, besides Boolean circuits, the most important nonuniform model of computation. This volume gives a survey of the latest research in this field. It presents a branching program-based approach to complexity theory. Starting with a definition of branching programs and a review of the former research, nondeterministic branching programs are introduced and investigated, thus allowing the description of some fundamental complexity classes. The book then concentrates on the new concept of Omega-branching programs. Apart from the usual binary tests they contain features for evaluating certain elementary Boolean functions and are suited for characterizing space-bounded complexity classes. By means of these characterizations the author demonstrates the separation of some restricted complexity classes. In the appendix a number of extremely restricted graph-accessibility problems are given, which are, due to the branching program descriptions in chapters 1-3, p-projection complete in the classes under consideration. Codice articolo 9783540513407
Quantità: 1 disponibili
Immagini fornite dal venditore
Modified Branching Programs and Their Computational Power
ISBN 10: 354051340X
ISBN 13: 9783540513407
Nuovo
Taschenbuch
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Branching Programs are, besides Boolean circuits, the most important nonuniform model of computation. This volume gives a survey of the latest research in this field. It presents a branching program-based approach to complexity theory. Starting with a definition of branching programs and a review of the former research, nondeterministic branching programs are introduced and investigated, thus allowing the description of some fundamental complexity classes. The book then concentrates on the new concept of Omega-branching programs. Apart from the usual binary tests they contain features for evaluating certain elementary Boolean functions and are suited for characterizing space-bounded complexity classes. By means of these characterizations the author demonstrates the separation of some restricted complexity classes. In the appendix a number of extremely restricted graph-accessibility problems are given, which are, due to the branching program descriptions in chapters 1-3, p-projection complete in the classes under consideration.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 144 pp. Englisch. Codice articolo 9783540513407
Quantità: 1 disponibili
Foto dell'editore
Modified Branching Programs and Their Computational Power (Lecture Notes in Computer Science, 370)
Da: Ria Christie Collections, Uxbridge, Regno Unito
Valutazione del venditore 5 su 5 stelle
Condizione: New. In. Codice articolo ria9783540513407_new
Quantità: Più di 20 disponibili
Immagini fornite dal venditore
Modified Branching Programs and Their Computational Power
Editore:
Springer Berlin Heidelberg Jul 1989, 1989
ISBN 10: 354051340X
ISBN 13: 9783540513407
Nuovo
Taschenbuch
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Branching Programs are, besides Boolean circuits, the most important nonuniform model of computation. This volume gives a survey of the latest research in this field. It presents a branching program-based approach to complexity theory. Starting with a definition of branching programs and a review of the former research, nondeterministic branching programs are introduced and investigated, thus allowing the description of some fundamental complexity classes. The book then concentrates on the new concept of Omega-branching programs. Apart from the usual binary tests they contain features for evaluating certain elementary Boolean functions and are suited for characterizing space-bounded complexity classes. By means of these characterizations the author demonstrates the separation of some restricted complexity classes. In the appendix a number of extremely restricted graph-accessibility problems are given, which are, due to the branching program descriptions in chapters 1-3, p-projection complete in the classes under consideration. 144 pp. Englisch. Codice articolo 9783540513407
Quantità: 2 disponibili
Foto dell'editore
Modified Branching Programs and Their Computational Power (Lecture Notes in Computer Science)
Da: GuthrieBooks, Spring Branch, TX, U.S.A.
Valutazione del venditore 5 su 5 stelle
Paperback. Condizione: Very Good. 038751340X Ex-library paperback in very nice condition with the usual markings and attachments. Codice articolo UTD14a2591
Quantità: 1 disponibili
Foto dell'editore
Modified Branching Programs and Their Computational Power
Da: Chiron Media, Wallingford, Regno Unito
Valutazione del venditore 5 su 5 stelle
PF. Condizione: New. Codice articolo 6666-IUK-9783540513407
Quantità: 10 disponibili