Thomas Thierauf
The Computational Complexity of Equivalence and Isomorphism Problems
Paperback Engels 2000 2000e druk 9783540410324
Verwachte levertijd ongeveer 9 werkdagen
Samenvatting
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.
Specificaties
ISBN13:9783540410324
Taal:Engels
Bindwijze:paperback
Aantal pagina's:135
Uitgever:Springer Berlin Heidelberg
Druk:2000
Hoofdrubriek:Automatisering algemeen, Computer en informatica
Lezersrecensies
Wees de eerste die een lezersrecensie schrijft!
Inhoudsopgave
Preliminaries.- Boolean Formulas and Circuits.- Branching Programs.
Rubrieken
- advisering
- algemeen management
- coaching en trainen
- communicatie en media
- economie
- financieel management
- inkoop en logistiek
- internet en social media
- it-management / ict
- juridisch
- leiderschap
- marketing
- mens en maatschappij
- non-profit
- ondernemen
- organisatiekunde
- personal finance
- personeelsmanagement
- persoonlijke effectiviteit
- projectmanagement
- psychologie
- reclame en verkoop
- strategisch management
- verandermanagement
- werk en loopbaan