The Computational Complexity of Equivalence and Isomorphism Problems (Lecture Notes in Computer Science, 1852)
Thierauf, Thomas
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.
Kategorien:
Jahr:
2000
Auflage:
2000
Verlag:
Springer
Sprache:
english
Seiten:
135
ISBN 10:
3540410325
ISBN 13:
9783540410324
Datei:
LIT , 924 KB
IPFS:
,
english, 2000
Dieses Buch ist für das Herunterladen wegen der Beschwerde des Urheberrechtsinhabers nicht verfügbar