The Computational Complexity of Equivalence and Isomorphism Problems
Seiten
2000
|
2000
Springer Berlin (Verlag)
978-3-540-41032-4 (ISBN)
Springer Berlin (Verlag)
978-3-540-41032-4 (ISBN)
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.
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.
Preliminaries.- Boolean Formulas and Circuits.- Branching Programs.
Erscheint lt. Verlag | 4.8.2000 |
---|---|
Reihe/Serie | Lecture Notes in Computer Science |
Zusatzinfo | VIII, 135 p. |
Verlagsort | Berlin |
Sprache | englisch |
Maße | 155 x 233 mm |
Gewicht | 218 g |
Themenwelt | Informatik ► Software Entwicklung ► User Interfaces (HCI) |
Mathematik / Informatik ► Informatik ► Theorie / Studium | |
Schlagworte | Äquivalenz • Automata • Complexity • Complexity Classes • Computational Complexity • Computational Models • Datentechnik • Equivalence Problem • Erfüllbarkeitsproblem der Aussagenlogik • formal language • Hardcover, Softcover / Informatik, EDV/Informatik • HC/Informatik, EDV/Informatik • Isomorphism Problem • Komplexität (Kybern.) • Logic • Satisfiability Problem • theory of computing • Turing Machine |
ISBN-10 | 3-540-41032-5 / 3540410325 |
ISBN-13 | 978-3-540-41032-4 / 9783540410324 |
Zustand | Neuware |
Haben Sie eine Frage zum Produkt? |
Mehr entdecken
aus dem Bereich
aus dem Bereich
Aus- und Weiterbildung zum UXQB® Certified Professional for Usability …
Buch | Hardcover (2023)
dpunkt (Verlag)
36,90 €
Aus- und Weiterbildung nach iSAQB-Standard zum Certified Professional …
Buch | Hardcover (2023)
dpunkt Verlag
34,90 €
Wissensverarbeitung - Neuronale Netze
Buch | Hardcover (2023)
Carl Hanser (Verlag)
34,99 €