Matches in Harvard for { <http://id.lib.harvard.edu/aleph/008533801/catalog> ?p ?o. }
Showing items 1 to 24 of
24
with 100 items per page.
- catalog abstract "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.".
- catalog contributor b11938468.
- catalog created "c2000.".
- catalog date "2000".
- catalog date "c2000.".
- catalog dateCopyrighted "c2000.".
- catalog description "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.".
- catalog description "Includes bibliographical references (p. [119]-130) and index.".
- catalog description "Preliminaries -- Boolean Formulas and Circuits -- Branching Programs.".
- catalog extent "viii, 135 p. ;".
- catalog identifier "3540410325".
- catalog isPartOf "Lecture notes in computer science ; 1852".
- catalog issued "2000".
- catalog issued "c2000.".
- catalog language "eng".
- catalog publisher "Berlin ; New York : Springer,".
- catalog subject "511.3 21".
- catalog subject "Computational complexity Data processing.".
- catalog subject "Computer science.".
- catalog subject "Isomorphisms (Mathematics) Data processing.".
- catalog subject "QA169 .T45 2000".
- catalog tableOfContents "Preliminaries -- Boolean Formulas and Circuits -- Branching Programs.".
- catalog title "The computational complexity of equivalence and isomorphism problems / Thomas Thierauf.".
- catalog type "text".