The computational complexity of equivalence and isomorphism problems /

Saved in:

Bibliographic Details
Author / Creator:	Thierauf, Thomas.
Imprint:	Berlin ; New York : Springer, ©2000.
Description:	1 online resource (viii, 135 pages).
Language:	English
Series:	Lecture notes in computer science, 0302-9743 ; 1852 Lecture notes in computer science ; 1852.
Subject:	Computational complexity -- Data processing. Isomorphisms (Mathematics) -- Data processing. Computational complexity -- Data processing. Isomorphisms (Mathematics) -- Data processing.
Format:	E-Resource Book
URL for this record:	http://pi.lib.uchicago.edu/1001/cat/bib/11064785

Hidden Bibliographic Details
ISBN:	9783540453031 3540453032 3540410325 9783540410324
Digital file characteristics:	text file PDF
Notes:	Includes bibliographical references (pages 121-130) and index. English. Print version record.
Summary:	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.
Other form:	Print version:Thierauf, Thomas. Computational complexity of equivalence and isomorphism problems. Berlin ; New York : Springer, ©2000 3540410325
Standard no.:	10.1007/3-540-45303-2

Similar Items