Zobacz książki o podobnej tematyce

Więcej informacji o The Computational Complexity of Equivalence and Isomorphism Problems

• Dane szczegółowe
• Opis
• Ulubione w innej kategorii

Za ten zakup dostaniesz 166 punkty

Opis

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.

Szczegóły książki

Kategoria Książki po angielsku Computing & information technology Computer science Mathematical theory of computation

• Pełny tytuł: The Computational Complexity of Equivalence and Isomorphism Problems
• Autor: Thomas Thierauf
• Język: Angielski
• Oprawa: Miękka
• Liczba stron: 135
• EAN: 9783540410324
• ISBN: 3540410325
• ID: 01563037
• Wydawca: Springer, Berlin
• Waga: 218 g
• Wymiary: 235 × 155 × 8 mm
• Rok wydania: 2000

Ulubione w innej kategorii

---

---

---