Skip to content

Opening book details…

Can I read The Computational Complexity of Equivalence and Isomorphism Problems (Lecture Notes in Computer Science, 1852) on EtoBox?

The Computational Complexity of Equivalence and Isomorphism Problems (Lecture Notes in Computer Science, 1852) by Thomas Thierauf (eds.) is a computer science book available to read on EtoBox.

What is The Computational Complexity of Equivalence and Isomorphism Problems (Lecture Notes in Computer Science, 1852) about?

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 compu

Who reads The Computational Complexity of Equivalence and Isomorphism Problems (Lecture Notes in Computer Science, 1852)?

It is typically read by working professionals who need an authoritative practice reference.

Common subject areas: medicine, law, business, engineering.

Author
Thomas Thierauf (eds.)
Publisher
Springer Berlin Heidelberg
Published
2000
Language
EN
ISBN
9783540410324
Category
computer science
Subjects
Mathematics, Computers, Computer Science
Updated
2026-03-25

More by Thomas Thierauf (eds.)

Browse all works by Thomas Thierauf (eds.)

Similar books