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 variables of F0 and F are a 1, ..., a, and the variables of Go and G1 are y1, ..., yn. By Lemma 3.39 we can ... (v1, ..., vim) be new variables. Define or((F0, FI), (Go , G1)) (D0, D1), where formulas D0 and 3.2 Comparing FI with Other Problems 59 .
|Title||:||The Computational Complexity of Equivalence and Isomorphism Problems|
|Publisher||:||Springer - 2003-06-29|