Placeholder text

Go to cart

The Computational Complexity of Equivalence and Isomorphism Problems

By Thomas Thierauf

Product Image: The Computational Complexity of Equivalence and Isomorphism Problems

The Computational Complexity of Equivalence and Isomorphism Problems

By Thomas Thierauf

0 - Default Title
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.
Product details
Binding:
Paperback
Edition:
1
Number of Pages:
148
Release Date:
2008-06-13
Publication Date:
2000-08-04
Publisher:
Springer
Languages:
Original: English
ISBN10:
3540410325
ISBN13:
9783540410324
GPSR Manufacturer Reference:
[email protected]
Weight:
236 g
Height:
155 cm
Width:
235 cm
Thickness:
9 cm
Buy on Amazon
Currently sold out