Free delivery for orders over 69.99 euro.

Check order status

Become part of a community of book lovers from all over the world and get access to a whole bunch of benefits. Create an account for free

Free delivery for purchases over 69.99 €

DPD courier 5.99 € Bpost point 7.99 € Bpost 7.49 € DPD point 3.49 € GLS courier 4.99 €

Contact

How to shop

Help

My account

▸ Empty :-(

Free delivery for orders over 69.99 euro.

Modified Branching Programs and Their Computational Power

Name: Modified Branching Programs and Their Computational Power
Brand: Springer, Berlin
SKU: 01565189
Price: 58.39 EUR
Availability: InStock
Author: Christoph Meinel
ISBN: 9783540513407

Christoph Meinel

Language

English

Book Paperback

Libristo code: 01565189

Publishers Springer, Berlin

Branching Programs are, besides Boolean circuits, the most important nonuniform model of computation... Full description

Libristo code: 01565189

141 b

58.39 €

Low in stock at our supplier Shipping in 11-15 days

Up to 30 days for returns

Customers also purchased

GIVEN 3 NATSUKI KIZU

Hardback

12.92 €

STUART MACRAE: STRING QUARTET (2002) - SCORE/PARTS MACRAE Book

binding.

46.36 €

Opa sur les juifs de France Cécilia Gabizon

Book

31.61 €

WIEGENLIED VIOLON JOHANNES BRAHMS Book

binding.

6.56 €

LA LETTRE MANQUANTE HALLUIN

Paperback

15.45 €

Quebec - 1.000 Teile (Puzzle)

Game

31.51 €

CENTROS HOSPITALRIOS ALTA RESOLUCION AND. PSICOTECNICO CLAVIJO

Paperback

42.32 €

El libro de Puente Jenil Aguilar y Cano

Hardback

82.84 €

Les caves du Potala DAI SIJIE

Paperback

12.01 €

Das Buch vom Pferde - Erster Band C.G. Wrangel

Paperback

44.44 €

Timelock, Band 3: Zeitmeister - spannender Mystery-Thriller von SPIEGEL-Bestseller-Autor Michael Peinkofer Michael Peinkofer

Paperback

10.19 €

Gedichte Stefan George

Paperback

15.85 €

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.