The Computational Complexity of Equivalence and Isomorphism Problems Image close
The Computational Complexity of Equivalence and Isomorphism Problems by Thomas Thierauf
The Computational Complexity of Equivalence and Isomorphism Problems by Thomas Thierauf
Show Hide Adult Content
The Computational Complexity of Equivalence and Isomorphism Problems close

Computers & Internet Books:

Home  
Books  
Computers & Internet  
Theory & Design  
Mathematical theory of computation

The Computational Complexity of Equivalence and Isomorphism Problems

Click to share your rating 0 ratings (0.0/5.0 average) Thanks for your vote!

By:

Format:

Paperback / softback
$151.00
Available from supplier

The item is brand new and in-stock with one of our preferred suppliers. The item will ship from a Mighty Ape warehouse within the timeframe shown.

Usually ships in 3-4 weeks
0 in Trolley
Free Delivery with Primate
Join Now

Free 14 day free trial, cancel anytime.

Buy Now, Pay Later with:

4 payments of $37.75 with Afterpay Learn more

6 weekly interest-free payments of $25.17 with Laybuy Learn more

Availability

Delivering to:

Estimated arrival:

  • Around 11-21 June using International Courier

Explore more Lecture Notes in Computer Science,

See all products in this series

Advances in Knowledge Discovery and Data Mining
$316.00
Advances in Knowledge Discovery and Data Mining
Paperback / softback
Pre-order - out 27 May 2024
Advances in Knowledge Discovery and Data Mining
$264.00
Advances in Knowledge Discovery and Data Mining
Paperback / softback
Pre-order - out 27 May 2024
Theory and Applications of Models of Computation
$368.00
Theory and Applications of Models of Computation
Paperback / softback
Pre-order - out 21 May 2024
Discrete Geometry and Mathematical Morphology by Sara Brunetti
$318.00
Discrete Geometry and Mathematical Morphology
by Sara Brunetti ~ Paperback / softback
Pre-order - out 6 Jun 2024
Dependable Computing - EDCC-1
$304.00
Dependable Computing - EDCC-1
Paperback / softback
Available - Usually ships in 3-4 weeks
Computing in Object-Oriented Parallel Environments
$151.00
Computing in Object-Oriented Parallel Environments
Paperback / softback
Available - Usually ships in 3-4 weeks
Transactions on Large-Scale Data- and Knowledge-Centered Systems XXIII
$151.00
Transactions on Large-Scale Data- and Knowledge-Centered Systems XXIII
Paperback / softback
Available - Usually ships in 3-4 weeks
High Performance Computing
$303.00
High Performance Computing
Paperback / softback
Available - Usually ships in 3-4 weeks
Machine Learning and Knowledge Discovery in Databases. Research Track
$321.00
Machine Learning and Knowledge Discovery in Databases. Research Track
Paperback / softback
Available - Usually ships in 3-4 weeks
Algorithmic Game Theory
$269.00
Algorithmic Game Theory
Paperback / softback
Available - Usually ships in 3-4 weeks
Evolutionary Multi-Criterion Optimization
$269.00
Evolutionary Multi-Criterion Optimization
Paperback / softback
Available - Usually ships in 3-4 weeks
Foundations of Software Science and Computation Structures
$161.00
Foundations of Software Science and Computation Structures
Paperback / softback
Available - Usually ships in 3-4 weeks
Pairing-Based Cryptography -- Pairing 2013
$151.00
Pairing-Based Cryptography -- Pairing 2013
Paperback / softback
Available - Usually ships in 3-4 weeks
Software Engineering - ESEC/FSE '99
$158.00
Software Engineering - ESEC/FSE '99
Paperback / softback
Available - Usually ships in 3-4 weeks
Software Architectures, Components, and Applications
$151.00
Software Architectures, Components, and Applications
Paperback / softback
Available - Usually ships in 3-4 weeks
Algorithmic Game Theory
$155.00
Algorithmic Game Theory
Paperback / softback
Available - Usually ships in 3-4 weeks

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 branching programs are considered.
Release date NZ
August 4th, 2000
Audiences
  • Postgraduate, Research & Scholarly
  • Professional & Vocational
  • Undergraduate
Illustrations
VIII, 135 p.
Pages
135
Dimensions
155x233x8
ISBN-13
9783540410324
Product ID
5810161

Customer reviews

Nobody has reviewed this product yet. You could be the first!

Write a Review

Marketplace listings

There are no Marketplace listings available for this product currently.
Already own it? Create a free listing and pay just 9% commission when it sells!

Sell Yours Here

Recommended for you

Recommended from your browsing history

Help & options

Filed under...

Books >
Computers & Internet >
Theory & Design >
Mathematical theory of computation
Books >
Computers & Internet >
Computer science >
Mathematical theory of computation