Doprava zdarma pre objednávky nad 59,99 € s Packetou a SPS Boxmi.

Zistiť stav objednávky

Staňte sa súčasťou komunity milovníkov kníh z celého sveta a získajte hromadu výhod. Založiť účet zdarma

Doprava zadarmo s Packetou nad 59.99 €

Kuriér DPD 2.99 € Zberné miesto GLS 2.49 € SPS 3.99 € SPS Parcel Shop 2.99 € Packeta kurýr 3.99 € Slovenská pošta 3.99 € Zberné miesto DPD 2.99 € Kuriér GLS 3.99 € Packeta 2.99 €

Kontakt

Ako nakupovať

Pomoc

Môj účet

▸ Prázdny :-(

Doprava zdarma pre objednávky nad 59,99 € s Packetou a SPS Boxmi.

Modified Branching Programs and Their Computational Power

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

Christoph Meinel

Jazyk

Angličtina

Kniha Brožovaná

Libristo kód: 01565189

Nakladateľstvo Springer, Berlin

Branching Programs are, besides Boolean circuits, the most important nonuniform model of computation... Celý popis

Libristo kód: 01565189

135 b

55.76 €

Skladom u dodávateľa v malom množstve Odosielame za 11-15 dní

Až 30 dní na vrátenie tovaru

Zákazníci tiež kúpili

GIVEN 3 NATSUKI KIZU

Pevná

12.92 €

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

binding.

46.36 €

Opa sur les juifs de France Cécilia Gabizon

Kniha

30.20 €

WIEGENLIED VIOLON JOHANNES BRAHMS Kniha

binding.

6.56 €

LA LETTRE MANQUANTE HALLUIN

Brožovaná

15.45 €

Quebec - 1.000 Teile (Puzzle)

Hra

31.51 €

CENTROS HOSPITALRIOS ALTA RESOLUCION AND. PSICOTECNICO CLAVIJO

Brožovaná

42.32 €

El libro de Puente Jenil Aguilar y Cano

Pevná

82.84 €

Les caves du Potala DAI SIJIE

Brožovaná

12.01 €

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

Brožovaná

44.44 €

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

Brožovaná

10.19 €

Gedichte Stefan George

Brožovaná

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.