The Computational Complexity of Equivalence and Isomorphism Problems by Thomas ThieraufThe Computational Complexity of Equivalence and Isomorphism Problems by Thomas Thierauf

The Computational Complexity of Equivalence and Isomorphism Problems

byThomas Thierauf

Paperback | August 4, 2000

Pricing and Purchase Info

$114.32 online 
$128.95 list price save 11%
Earn 572 plum® points

Prices and offers may vary in store

Quantity:

In stock online

Ships free on orders over $25

Not available in stores

about

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.
Title:The Computational Complexity of Equivalence and Isomorphism ProblemsFormat:PaperbackDimensions:148 pages, 9.17 × 6.1 × 0 inPublished:August 4, 2000Publisher:Springer Berlin HeidelbergLanguage:English

The following ISBNs are associated with this title:

ISBN - 10:3540410325

ISBN - 13:9783540410324

Look for similar items by category:

Reviews

Table of Contents

Preliminaries.- Boolean Formulas and Circuits.- Branching Programs.