The Computational Complexity of Equivalence and Isomorphism Problems - Lecture Notes in Computer Science - Thomas Thierauf - Books - Springer-Verlag Berlin and Heidelberg Gm - 9783540410324 - August 4, 2000
In case cover and title do not match, the title is correct

Thomas Thierauf
The Computational Complexity of Equivalence and Isomorphism Problems - Lecture Notes in Computer Science 2000 edition

Price
HK$ 438
excl. VAT

Ordered from remote warehouse

Expected to be ready for shipping Jun 15 - 19

Our customers say:

14-day return policy in accordance with European consumer protection law
Top ranking on Trustpilot
Add to your iMusic wish list

A computational model is a framework for doing computations according to certain specified rules on some input data. This monograph analyzes the computational complexity of the satisfiability, equivalence, and almost equivalence problems with respect to various computational models.

135 pages, biography

Media Books     Paperback Book   (Book with soft cover and glued back)
Released August 4, 2000
ISBN13 9783540410324
Publishers Springer-Verlag Berlin and Heidelberg Gm
Pages 135
Dimensions 155 × 233 × 8 mm   ·   217 g
Language English  

Mere med samme udgiver

See all of Thomas Thierauf ( e.g. Paperback Book )