BIBLIO is the largest independent book marketplace in the world, with over 100 million books.

Skip to content

The Computational Complexity of Equivalence and Isomorphism Problems

The Computational Complexity of Equivalence and Isomorphism Problems

The Computational Complexity of Equivalence and Isomorphism Problems Paperback - 2000 - 2000th Edition

by Thomas Thierauf

Add to wish list
  • New
  • Paperback
New

Description

Paperback. New. New Book; Fast Shipping from UK; Not signed; Not First Edition; 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
Ask the seller a question Add to wish list
A$101.13
A$15.41 Delivery to USA
Standard delivery: 7 to 12 days
More delivery options
Ships from Ria Christie Collections (Greater London, United Kingdom)

Details

About Ria Christie Collections Greater London, United Kingdom

Biblio member since 2014

Hello We are professional online booksellers. We sell mostly new books and textbooks and we do our best to provide a competitive price. We are based in Greater London, UK. We pride ourselves by providing a good customer service throughout, shipping the items quickly and replying to customer queries promptly. Ria Christie Collections

Terms of Sale:

30 day return guarantee, with full refund including original shipping costs for up to 30 days after delivery if an item arrives misdescribed or damaged.

Browse books from Ria Christie Collections

Reader reviews for The Computational Complexity of Equivalence and Isomorphism Problems

From the publisher

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