Format:
Online-Ressource
ISBN:
9783540453031
,
3540410325
Series Statement:
Lecture Notes in Computer Science 1852
Content:
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
Note:
Includes bibliographical references and index
Additional Edition:
ISBN 9783540410324
Additional Edition:
Buchausg. u.d.T. Thierauf, Thomas The computational complexity of equivalence and isomorphism problems Berlin : Springer, 2000 ISBN 3540410325
Language:
English
Subjects:
Computer Science
Keywords:
Berechnungskomplexität
;
Binäres Entscheidungsdiagramm
;
Berechnungskomplexität
;
Binäres Entscheidungsdiagramm
DOI:
10.1007/3-540-45303-2
URL:
Volltext
(lizenzpflichtig)
URL:
Volltext
(lizenzpflichtig)
Bookmarklink
