ENGLISH

The Computational Complexity of Equivalence and Isomorphism Problems

By Thomas Thierauf (eds.)

Book information

Publisher
Springer-Verlag Berlin Heidelberg
Year
2000
ISBN
3540410325, 9783540410324
DOI
10.1007/3-540-45303-2
LCC
QA267.7 .T48 2000
Open Library ID
OL6898718M
Language
english
Format
PDF
Filesize
1 MB (1343840 bytes)
Series
Lecture Notes in Computer Science 1852
Edition
1
Pages
135\143
Topic
Computers
Scanned
yes
Time added
2011-06-04 13:46:07
Computation by Abstract Devices

Description

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.

Similar books