Check order status

Become part of a community of book lovers from all over the world and get access to a whole bunch of benefits. Create an account for free

DPD courier 4.99 € GLS courier 9.99 €

Contact

How to shop

Help

My account

▸ Empty :-(

The Computational Complexity of Equivalence and Isomorphism Problems

Name: The Computational Complexity of Equivalence and Isomorphism Problems
Brand: Springer, Berlin
SKU: 01563037
Price: 51.36 EUR
Availability: InStock
Author: Thomas Thierauf
ISBN: 9783540410324

Thomas Thierauf

Language

English

Book Paperback

Libristo code: 01563037

Publishers Springer, Berlin, November 1999

A computational model is a framework for doing computations according to certain specified rules on... Full description

Libristo code: 01563037

125 b

51.36 €

In stock at our supplier Shipping in 5-8 days

Up to 30 days for returns

Customers also purchased

Fisioterapeuta del Servicio Canario de Salud. Temario volumen 1 7

Paperback

58.10 €

SOUS L'ARCHE DU TEMPS : ESSAIS SUIVI D'ENTRETIENS DORION HELENE Book

binding.

21.00 €

J'habille mes amies - Chats et chiens Fiona Watt

Paperback

13.56 €

Das Glück trägt Blumen als Gewand Andreas Krauße

Paperback

9.24 €

Tratamiento constitucional de las FAS Manuel Trujillo Alcaraz

Paperback

35.38 €

Declaration A Mes Commettans Bailleul-J-C

Paperback

13.16 €

Vielleicht Esther Katja Petrowskaja

Paperback

10.85 €

Theodor Storm Gertrud Storm

Paperback

45.23 €

DIE DREI RINGE Elke Stolzenburg

Paperback

12.56 €

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.