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 (Lecture Notes in Computer Science, 1852)

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

The Computational Complexity of Equivalence and Isomorphism Problems (Lecture
Stock photo: cover may vary

The Computational Complexity of Equivalence and Isomorphism Problems (Lecture Notes in Computer Science, 1852) Paperback - 2000 - 2000th Edition

by Thierauf, Thomas

Add to wish list
  • Used
  • Good
  • Paperback
Used - Good

Description

paperback. Good. Access codes and supplements are not guaranteed with used items. May be an ex-library book.
Ask the seller a question Add to wish list
A$127.14
Free Delivery within USA
Standard delivery: 7 to 14 days
More delivery options
Dropship order
Ships from Bonita (California, United States)

Details

About Bonita California, United States

Biblio member since 2020

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 Bonita

Reader reviews for The Computational Complexity of Equivalence and Isomorphism Problems (Lecture Notes in Computer Science, 1852)

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-