Computational Complexity of Equivalence and Isomorphism Problems

Name: Computational Complexity of Equivalence and Isomorphism Problems
Price: 39.18 USD
Availability: InStock
ISBN: 9783540410324

ISBN-10: 3540410325

ISBN-13: 9783540410324

Edition: 2000

Authors: Thomas Thierauf

List price: $54.99

30 day, 100% satisfaction guarantee!

Marketplace

2 new & used from $39.18

what's this?

Rush Rewards U
Members Receive:

You have reached 400 XP and carrot coins. That is the daily max!

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…

Book details

List price: $54.99
Copyright year: 2000
Publisher: Springer Berlin / Heidelberg
Publication date: 8/4/2000
Binding: Paperback
Pages: 135
Size: 6.10" wide x 9.17" long x 0.25" tall
Weight: 1.056
Language: English




Introduction



Equivalence Problems



Isomorphism Problems



Preliminaries



Complexity Classes



Reductions



Probabilistic Complexity Classes



Probabilistic Quantifiers



Interactive Proofs



Isomorphisms and Other Transformations



Boolean Formulas and Circuits



An Interactive Proof for FNI



Comparing FI with Other Problems



Branching Programs



Read-k-Times Branching Programs



Polynomials



Ordered Branching Programs



Nondeterministic Branching Programs



Parity Branching Programs



Probabilistic Branching Programs


References


Index