The computational complexity of equivalence and isomorphism problems
A computational model is a framework for doing computations according to certain specified rules on some input data. These models come for example from automata theory, formal language theory, logic, or circuit theory. The computational power of such a model can be judged by evaluating certain probl...
Gardado en:
| Autor Principal: | |
|---|---|
| Formato: | Livre numérique |
| Idioma: | Anglais |
| Publicado: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Series: | Lecture notes in computer science
1852 |
| Sujets: | |
| Acceso en liña: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Nota: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • The computational complexity of equivalence and isomorphism problems, Thomas Thierauf, 2000, Berlin, Springer, 1 vol. (VIII-135 p.), Lecture notes in computer science, 3-540-41032-5 • The Computational Complexity of Equivalence and Isomorphism Problems, Texte imprimé, 9783662214626 |
Table des matières:
- Preliminaries
- Boolean Formulas and Circuits
- Branching Programs.