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: |
| Summary: | 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 problems with respect to that model. The theory of computations is the study of the inherent difficulty of computational problems, that is, their computational complexity. This monograph analyzes the computational complexity of the satisfiability, equivalence, and almost-equivalence problems with respect to various computational models. In particular, Boolean formulas, circuits, and various kinds of branching programs are considered. |
|---|---|
| Physical Description: | 1 online resource (viii, 135 pages) |
| Bibliography: | Includes bibliographical references (pages 121-130) and index. |
| ISBN: | 9783540453031 3540453032 |
| ISSN: | 0302-9743 ; |