| 书目名称 | The Computational Complexity of Equivalence and Isomorphism Problems |
| 编辑 | Thomas Thierauf |
| 视频video | |
| 概述 | Includes supplementary material: |
| 丛书名称 | Lecture Notes in Computer Science |
| 图书封面 |  |
| 描述 | 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.. |
| 出版日期 | Book 2000 |
| 关键词 | Complexity Classes; Computational Complexity; Computational Models; Equivalence Problem; Erfüllbarkeitsp |
| 版次 | 1 |
| doi | https://doi.org/10.1007/3-540-45303-2 |
| isbn_softcover | 978-3-540-41032-4 |
| isbn_ebook | 978-3-540-45303-1Series ISSN 0302-9743 Series E-ISSN 1611-3349 |
| issn_series | 0302-9743 |
| copyright | Springer-Verlag Berlin Heidelberg 2000 |
发表于 2025-3-21 16:12:37
