The Computational Complexity of Equivalence and Isomorphism Problems (Lecture Notes in Computer Science, 1852, Band 1852) - Softcover

Thierauf, Thomas

 
9783540410324: The Computational Complexity of Equivalence and Isomorphism Problems (Lecture Notes in Computer Science, 1852, Band 1852)
Softcover
ISBN 10: 3540410325 ISBN 13: 9783540410324
Verlag: Springer, 2008

Inhaltsangabe

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.

Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.

Verlag
Springer
Erscheinungsdatum
2008
Sprache
Englisch
ISBN 10 
3540410325
ISBN 13 
9783540410324
Einband
Taschenbuch
Anzahl der Seiten
142
Kontakt zum Hersteller
ProductSafety@springernature.com
ProductSafety@springernature.com

Poststr. 9
Darmstadt
64293
Deutschland