The Computational Complexity of Equivalence and Isomorphism Problems

  • Thomas Thierauf

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1852)

Table of contents

  1. Front Matter
    Pages I-VIII
  2. Pages 1-10
  3. Pages 11-22
  4. Pages 65-120
  5. Back Matter
    Pages 121-135

About this book

Introduction

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.

Keywords

Complexity Classes Computational Complexity Computational Models Equivalence Problem Erfüllbarkeitsproblem der Aussagenlogik Isomorphism Problem Satisfiability Problem Theory of Computing Turing Machine automata complexity formal language logic

Editors and affiliations

  • Thomas Thierauf
    • 1
  1. 1.Fakultät für Informatik Abteilung Theoretische InformatikUniversität UlmUlmGermany

Bibliographic information

  • DOI https://doi.org/10.1007/3-540-45303-2
  • Copyright Information Springer-Verlag Berlin Heidelberg 2000
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-41032-4
  • Online ISBN 978-3-540-45303-1
  • Series Print ISSN 0302-9743
  • About this book
Industry Sectors
Electronics
Telecommunications
Biotechnology