The computational complexity of equivalence and isomorphism problems - Info and Reading Options
By Thomas Thierauf

"The computational complexity of equivalence and isomorphism problems" was published by Springer in 2000 - Berlin, it has 135 pages and the language of the book is English.
“The computational complexity of equivalence and isomorphism problems” Metadata:
- Title: ➤ The computational complexity of equivalence and isomorphism problems
- Author: Thomas Thierauf
- Language: English
- Number of Pages: 135
- Publisher: Springer
- Publish Date: 2000
- Publish Location: Berlin
“The computational complexity of equivalence and isomorphism problems” Subjects and Themes:
Edition Specifications:
- Pagination: viii, 135 p. ;
Edition Identifiers:
- The Open Library ID: OL6898718M - OL7833786W
- Online Computer Library Center (OCLC) ID: 44937393
- Library of Congress Control Number (LCCN): 00703237
- ISBN-13: 9783540410324 - 9783540453031
- ISBN-10: 3540410325
- All ISBNs: 3540410325 - 9783540410324 - 9783540453031
AI-generated Review of “The computational complexity of equivalence and isomorphism problems”:
"The computational complexity of equivalence and isomorphism problems" Description:
Open Data:
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
Read “The computational complexity of equivalence and isomorphism problems”:
Read “The computational complexity of equivalence and isomorphism problems” by choosing from the options below.
Search for “The computational complexity of equivalence and isomorphism problems” downloads:
Visit our Downloads Search page to see if downloads are available.
Find “The computational complexity of equivalence and isomorphism problems” in Libraries Near You:
Read or borrow “The computational complexity of equivalence and isomorphism problems” from your local library.
- The WorldCat Libraries Catalog: Find a copy of “The computational complexity of equivalence and isomorphism problems” at a library near you.
Buy “The computational complexity of equivalence and isomorphism problems” online:
Shop for “The computational complexity of equivalence and isomorphism problems” on popular online marketplaces.
- Ebay: New and used books.