Opening book details…
Can I read The Computational Complexity of Equivalence and Isomorphism Problems (Lecture Notes in Computer Science, 1852) on EtoBox?
The Computational Complexity of Equivalence and Isomorphism Problems (Lecture Notes in Computer Science, 1852) by Thomas Thierauf (eds.) is a nonfiction available to read on EtoBox.
What is The Computational Complexity of Equivalence and Isomorphism Problems (Lecture Notes in Computer Science, 1852) about?
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. Preliminaries -- Boolean Formulas And Circuits -- Branching Programs. Thomas Thierauf. Includes Bibliographical References (p. [119]-130) And Index.
Who reads The Computational Complexity of Equivalence and Isomorphism Problems (Lecture Notes in Computer Science, 1852)?
It is typically read by self-directed learners exploring a subject in depth.
Common subject areas: history, science, philosophy, social sciences.
- Author
- Thomas Thierauf (eds.)
- Publisher
- Springer-Verlag Berlin Heidelberg
- Published
- 2000
- Language
- EN
- ISBN
- 9788354045304
- Category
- nonfiction
- Subjects
- Mathematics, Computer Science, Stem
More by Thomas Thierauf (eds.)
Browse all works by Thomas Thierauf (eds.)
Similar books
- Transactions On Computational Science Iii (lecture Notes In Computer Science) — Alexei Sourin, Olga Sourina, Lei Wei, Paul Gagnon (auth.), Marina L. Gavrilova, C. J. Kenneth Tan (2009)
- Logic And Computational Complexity: International Workshop, Lcc '94, Indianapolis, In, Usa, October 13-16, 1994. Selected Papers (lecture Notes In Computer Science) — Felice Cardone (auth.), Daniel Leivant (1995)
- Lecture Notes in Computer Science: Group Theoretic Algorithms and Graph Isomorphism (Lecture Notes in Computer Science) — Christoph M. Hoffmann (1982)
- Intelligent Perceptual Systems: New Directions in Computational Perception (Lecture Notes in Computer Science / Lecture Notes in Artific) — Riccardo Luccio (auth.), Vito Roberto (1993)
- Transactions on Computational Collective Intelligence V (Lecture Notes in Computer Science, 6910) — Ali Selamat (auth.), Ngoc Thanh Nguyen (2011)
- Transactions on Computational Systems Biology VII (Lecture Notes in Computer Science) — Muffy Calder, Stephen Gilmore, Jane Hillston (auth.), Corrado Priami, Anna Ingólfsdóttir, Bud Mishra, Hanne Riis Nielson (2006)
