The computational complexity of equivalence and isomorphism problems [electronic resource] / Thomas Thierauf.
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...
Saved in:
| Online Access: |
Full Text (via Springer) |
|---|---|
| Main Author: | |
| Format: | Electronic eBook |
| Language: | English |
| Published: |
Berlin ; New York :
Springer,
©2000.
|
| Series: | Lecture notes in computer science ;
1852. |
| Subjects: |
Internet
Full Text (via Springer)Online
| Call Number: |
QA267.7
|
|---|---|
| QA267.7 | Available |