TY - BOOK ID - 7534496 TI - The Computational Complexity of Equivalence and Isomorphism Problems PY - 2000 SN - 3540410325 3540453032 PB - Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, DB - UniCat KW - Computational complexity KW - Isomorphisms (Mathematics) KW - Algebra KW - Mathematics KW - Physical Sciences & Mathematics KW - Data processing KW - Data processing. KW - Complexity, Computational KW - Computer science. KW - Computers. KW - Computer Science. KW - Theory of Computation. KW - Computation by Abstract Devices. KW - Electronic data processing KW - Machine theory KW - Categories (Mathematics) KW - Group theory KW - Morphisms (Mathematics) KW - Set theory KW - Information theory. KW - Informatics KW - Science KW - Communication theory KW - Communication KW - Cybernetics KW - Automatic computers KW - Automatic data processors KW - Computer hardware KW - Computing machines (Computers) KW - Electronic brains KW - Electronic calculating-machines KW - Electronic computers KW - Hardware, Computer KW - Computer systems KW - Calculators KW - Cyberspace UR - https://www.unicat.be/uniCat?func=search&query=sysid:7534496 AB - 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. ER -