Inicio > > Ciencias de la computación > The Computational Complexity of Equivalence and Isomorphism Problems
The Computational Complexity of Equivalence and Isomorphism Problems

The Computational Complexity of Equivalence and Isomorphism Problems

Thomas Thierauf

66,98 €
IVA incluido
Disponible
Editorial:
Springer Nature B.V.
Año de edición:
2000
Materia
Ciencias de la computación
ISBN:
9783540410324
66,98 €
IVA incluido
Disponible

Selecciona una librería:

  • Librería Samer Atenea
  • Librería Aciertas (Toledo)
  • Kálamo Books
  • Librería Perelló (Valencia)
  • Librería Elías (Asturias)
  • Donde los libros
  • Librería Kolima (Madrid)
  • Librería Proteo (Málaga)

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.

Artículos relacionados