Item description for The Computational Complexity of Equivalence and Isomorphism Problems (Lecture Notes in Computer Science) by Thomas Thierauf...
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.
Promise Angels is dedicated to bringing you great books at great prices. Whether you read for entertainment, to learn, or for literacy - you will find what you want at promiseangels.com!
Est. Packaging Dimensions: Length: 9" Width: 6.1" Height: 0.4" Weight: 0.5 lbs.
Release Date Oct 2, 2000
ISBN 3540410325 ISBN13 9783540410324
Availability 120 units. Availability accurate as of Mar 26, 2017 05:00.
Usually ships within one to two business days from La Vergne, TN.
Orders shipping to an address other than a confirmed Credit Card / Paypal Billing address may incur and additional processing delay.