Editors:
- Includes supplementary material: sn.pub/extras
Part of the book series: Lecture Notes in Computer Science (LNCS, volume 1852)
Buy it now
Buying options
Tax calculation will be finalised at checkout
Other ways to access
This is a preview of subscription content, log in via an institution to check for access.
Table of contents (4 chapters)
-
Front Matter
-
Back Matter
About this book
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.
Editors and Affiliations
-
Fakultät für Informatik Abteilung Theoretische Informatik, Universität Ulm, Ulm, Germany
Thomas Thierauf
Bibliographic Information
Book Title: The Computational Complexity of Equivalence and Isomorphism Problems
Editors: Thomas Thierauf
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/3-540-45303-2
Publisher: Springer Berlin, Heidelberg
-
eBook Packages: Springer Book Archive
Copyright Information: Springer-Verlag Berlin Heidelberg 2000
Softcover ISBN: 978-3-540-41032-4Published: 04 August 2000
eBook ISBN: 978-3-540-45303-1Published: 29 June 2003
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: VIII, 135
Topics: Theory of Computation, Computation by Abstract Devices