The Computational Complexity of Equivalence and Isomorphism Problems

• Main Author: Thierauf, Thomas (Author, http://id.loc.gov/vocabulary/relators/aut)
• Corporate Author: SpringerLink (Online service)
• Format: Electronic eBook
• Language: English
• Published: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2000.
• Edition: 1st ed. 2000.
• Series: Lecture Notes in Computer Science, 1852
• Subjects: Computers.; Theory of Computation.; Computation by Abstract Devices.

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...

Table of Contents:

• Preliminaries
• Boolean Formulas and Circuits
• Branching Programs.