The Computational Complexity of Equivalence and Isomorphism Problems

• Κύριος συγγραφέας: Thierauf, Thomas (Συγγραφέας, http://id.loc.gov/vocabulary/relators/aut)
• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2000.
• Έκδοση: 1st ed. 2000.
• Σειρά: Lecture Notes in Computer Science, 1852
• Θέματα: Computers.; Theory of Computation.; Computation by Abstract Devices.

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 probl...

Πίνακας περιεχομένων:

• Preliminaries
• Boolean Formulas and Circuits
• Branching Programs.