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
Stock photo: cover may vary

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

by Thomas Thierauf

Add to wish list

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.

Details

  • Title The Computational Complexity of Equivalence and Isomorphism Problems
  • Author Thomas Thierauf
  • Binding Paperback
  • Edition number 2000th
  • Edition 2000
  • Pages 135
  • Volumes 1
  • Language ENG
  • Publisher Springer
  • Publication date 2000-08-04
  • ISBN 9783540410324 / 3540410325
  • Weight 0.48 lbs (0.22 kg)
  • Dimensions 9.21 x 6.14 x 0.32 in (23.39 x 15.60 x 0.81 cm)
  • Category Mathematics
  • Library of Congress Catalogue Number 00703237
  • Dewey Decimal Code 511.3

More Copies for Sale

The Computational Complexity of Equivalence and Isomorphism Problems

The Computational Complexity of Equivalence and Isomorphism Problems

by Thomas Thierauf

  • New
  • Paperback
Condition
New
Binding
Paperback
ISBN 10 / ISBN 13
9783540410324 / 3540410325
Quantity available
378
Seller
Item price
A$101.13
A$15.41 Delivery to USA

Show details

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
Add to wish list
Item price
A$101.13
A$15.41 Delivery to USA
The Computational Complexity Of Equivalence and Isomorphism Problems
Stock photo: cover may vary

The Computational Complexity Of Equivalence and Isomorphism Problems

by Thierauf, Thomas,

  • New
Condition
New
ISBN 10 / ISBN 13
9783540410324 / 3540410325
Quantity available
5
Seller
Item price
A$93.03
A$5.74 Delivery to USA

Show details

Description:
new.
Add to wish list
Item price
A$93.03
A$5.74 Delivery to USA
The Computational Complexity of Equivalence and Isomorphism Problems (Lecture Notes in Computer...
Stock photo: cover may vary

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

by Thierauf, Thomas

  • New
  • Paperback
Condition
New
Edition
2000
Binding
Paperback
ISBN 10 / ISBN 13
9783540410324 / 3540410325
Quantity available
1
Seller
Item price
A$98.79
Free Delivery to USA

Show details

Description:
Springer, 2000-08-04. 2000. paperback. New. 6.10x0.32x9.25. Buy with confidence. Excellent Customer Service & Return policy.
Add to wish list
Item price
A$98.79
Free Delivery to USA
The Computational Complexity of Equivalence and Isomorphism Problems

The Computational Complexity of Equivalence and Isomorphism Problems

by Thomas Thierauf

  • New
  • Paperback
Condition
New
Binding
Paperback
ISBN 10 / ISBN 13
9783540410324 / 3540410325
Quantity available
10
Seller
Item price
A$152.04
A$19.20 Delivery to USA

Show details

Description:
Paperback / softback. New. 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.
Add to wish list
Item price
A$152.04
A$19.20 Delivery to USA
The Computational Complexity Of Equivalence and Isomorphism Problems
Stock photo: cover may vary

The Computational Complexity Of Equivalence and Isomorphism Problems

by Thierauf, Thomas,

  • Used
Condition
New
ISBN 10 / ISBN 13
9783540410324 / 3540410325
Quantity available
5
Seller
Item price
A$118.33
A$5.74 Delivery to USA

Show details

Description:
like new.
Add to wish list
Item price
A$118.33
A$5.74 Delivery to USA
The Computational Complexity of Equivalence and Isomorphism Problems (Lecture Notes in Computer...
Stock photo: cover may vary

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

by Thierauf, Thomas

  • Used
  • Paperback
Condition
Used
Edition
2000
Binding
Paperback
ISBN 10 / ISBN 13
9783540410324 / 3540410325
Quantity available
1
Seller
Item price
A$124.08
Free Delivery to USA

Show details

Description:
Springer, 2000-08-04. 2000. paperback. Used: Good. 6.10x0.32x9.25. Buy with confidence. Excellent Customer Service & Return policy.
Add to wish list
Item price
A$124.08
Free Delivery to USA
The Computational Complexity of Equivalence and Isomorphism Problems (Lecture Notes in Computer...
Stock photo: cover may vary

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

by Thierauf, Thomas

  • Used
  • Good
  • Paperback
Condition
Good
Binding
Paperback
ISBN 10 / ISBN 13
9783540410324 / 3540410325
Quantity available
1
Seller
Item price
A$127.14
Free Delivery to USA

Show details

Description:
paperback. Good. Access codes and supplements are not guaranteed with used items. May be an ex-library book.
Add to wish list
Item price
A$127.14
Free Delivery to USA