The Computational Complexity of Equivalence and Isomorphism Problems
Thierauf, Thomas.
The Computational Complexity of Equivalence and Isomorphism Problems [electronic resource] / by Thomas Thierauf. - 1st ed. 2000. - VIII, 135 p. online resource. - Lecture Notes in Computer Science, 1852 1611-3349 ; . - Lecture Notes in Computer Science, 1852 .
Preliminaries -- Boolean Formulas and Circuits -- Branching Programs.
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.
9783540453031
10.1007/3-540-45303-2 doi
Computer science.
Theory of Computation.
QA75.5-76.95
004.0151
The Computational Complexity of Equivalence and Isomorphism Problems [electronic resource] / by Thomas Thierauf. - 1st ed. 2000. - VIII, 135 p. online resource. - Lecture Notes in Computer Science, 1852 1611-3349 ; . - Lecture Notes in Computer Science, 1852 .
Preliminaries -- Boolean Formulas and Circuits -- Branching Programs.
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.
9783540453031
10.1007/3-540-45303-2 doi
Computer science.
Theory of Computation.
QA75.5-76.95
004.0151