The Computational Complexity of Equivalence and Isomorphism Problems - Couverture souple

Thierauf, Thomas

 
9783540410324: The Computational Complexity of Equivalence and Isomorphism Problems
Couverture souple
ISBN 10 : 3540410325 ISBN 13 : 9783540410324
Editeur : Springer, 2008

Synopsis

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.

Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.

Éditeur
Springer
Date d'édition
2008
Langue
anglais
ISBN 10 
3540410325
ISBN 13 
9783540410324
Reliure
Broché
Nombre de pages
142
Coordonnées du fabricant
Springer Nature Customer Service Center GmbH
ProductSafety@springernature.com

Europaplatz 3
Heidelberg
69115
Allemagne