Modified branching programs and their computational power
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...
Wedi'i Gadw mewn:
| Prif Awdur: | |
|---|---|
| Fformat: | Livre numérique |
| Iaith: | Anglais |
| Cyhoeddwyd: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Cyfres: | Lecture notes in computer science
370 |
| Pynciau: | |
| Mynediad Ar-lein: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Nodyn: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Modified branching programs and their computational power, Christoph Meinel, Berlin, Springer-Verlag, 1989, 1 vol. (VI-132 p.), Lecture notes in computer science, 3-540-51340-X • Modified Branching Programs and Their Computational Power, Texte imprimé, 9783662163597 |
Tabl Cynhwysion:
- Preliminaries
- Branching programs and their computational power
- Nondeterministic branching programs
- ?=branching programs and theirs computational power.