Custom cover image
Custom cover image

The Computational Complexity of Equivalence and Isomorphism Problems / edited by Thomas Thierauf

By: Resource type: Ressourcentyp: Buch (Online)Book (Online)Language: English Series: SpringerLink Bücher | Springer eBook Collection Computer Science | Lecture notes in computer science ; 1852Publisher: Berlin, Heidelberg : Springer-Verlag Berlin Heidelberg, 2000Description: Online-RessourceISBN:
  • 9783540453031
  • 3540410325
Subject(s): Additional physical formats: 9783540410324 | Buchausg. u.d.T.: The computational complexity of equivalence and isomorphism problems. Berlin : Springer, 2000. VIII, 135 S.DDC classification:
  • 004.0151 23
  • 511.3
MSC: MSC: *68Q25 | 68-02 | 05C60 | 68W20RVK: RVK: SS 4800LOC classification:
  • QA75.5-76.95
DOI: DOI: 10.1007/3-540-45303-2Online resources:
Contents:
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 consideredPPN: PPN: 1649245661Package identifier: Produktsigel: ZDB-2-BAE | ZDB-2-LNC | ZDB-2-SCS | ZDB-2-SXCS | ZDB-2-SEB
No physical items for this record
KIT – The University in the Helmholtz Association                         Home | Impressum | Datenschutz | Barrierefreiheit | KIT