找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Structural Complexity I; José Luis Balcázar,Josep Díaz,Joaquim Gabarró Textbook 1995Latest edition Springer-Verlag Berlin Heidelberg 1995

[复制链接]
查看: 55164|回复: 44
发表于 2025-3-21 18:10:06 | 显示全部楼层 |阅读模式
书目名称Structural Complexity I
编辑José Luis Balcázar,Josep Díaz,Joaquim Gabarró
视频video
丛书名称Texts in Theoretical Computer Science. An EATCS Series
图书封面Titlebook: Structural Complexity I;  José Luis Balcázar,Josep Díaz,Joaquim Gabarró Textbook 1995Latest edition Springer-Verlag Berlin Heidelberg 1995
描述In the six years since the first edition of this book was published, the field of Structural Complexity has grown quite a bit. However, we are keeping this volume at the same basic level that it had in the first edition, and the only new result incorporated as an appendix is the closure under complementation of nondeterministic space classes, which in the previous edition was posed as an open problem. This result was already included in our Volume II, but we feel that due to the basic nature of the result, it belongs to this volume. There are of course other important results obtained during these last six years. However, as they belong to new areas opened in the field they are outside the scope of this fundamental volume. Other changes in this second edition are the update of some Bibliograph­ ical Remarks and references, correction of many mistakes and typos, and a renumbering of the definitions and results. Experience has shown us that this new numbering is a lot more friendly, and several readers have confirmed this opinion. For the sake of the reader of Volume II, where all references to Volume I follow the old numbering, we have included here a table indicating the new number
出版日期Textbook 1995Latest edition
关键词Berechnungsmodelle; Complexity Classes; Komplexitätsklassen; Models of Computation; Probabilistic Algori
版次2
doihttps://doi.org/10.1007/978-3-642-79235-9
isbn_softcover978-3-642-79237-3
isbn_ebook978-3-642-79235-9Series ISSN 1862-4499 Series E-ISSN 1862-4502
issn_series 1862-4499
copyrightSpringer-Verlag Berlin Heidelberg 1995
The information of publication is updating

书目名称Structural Complexity I影响因子(影响力)




书目名称Structural Complexity I影响因子(影响力)学科排名




书目名称Structural Complexity I网络公开度




书目名称Structural Complexity I网络公开度学科排名




书目名称Structural Complexity I被引频次




书目名称Structural Complexity I被引频次学科排名




书目名称Structural Complexity I年度引用




书目名称Structural Complexity I年度引用学科排名




书目名称Structural Complexity I读者反馈




书目名称Structural Complexity I读者反馈学科排名




单选投票, 共有 0 人参与投票
 

0票 0%

Perfect with Aesthetics

 

0票 0%

Better Implies Difficulty

 

0票 0%

Good and Satisfactory

 

0票 0%

Adverse Performance

 

0票 0%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 21:06:34 | 显示全部楼层
Time and Space Bounded Computations, and the space used by the different models of Turing machines. Remember once more that the aim of this book is the study of structural properties of sets and classes of sets, and that these first two chapters are included for the sake of completeness. Readers interested in pursuing the specific top
发表于 2025-3-22 02:07:52 | 显示全部楼层
发表于 2025-3-22 05:43:20 | 显示全部楼层
Nonuniform Complexity,thms solving the problems. But any finite set can be recognized in constant time and zero work space by a deterministic finite automaton; therefore, measuring the amount of resources is meaningless when considering only finite sets. The “intrinsically algorithmic” approach makes sense only when deal
发表于 2025-3-22 09:15:36 | 显示全部楼层
Probabilistic Algorithms, to the analysis of the average case complexity of deterministic exact or approximate algorithms. On the other hand, (pseudo-)random number generators can be incorporated into an algorithm, in such a way that the algorithm will answer correctly with a reasonably high probability. These are called pr
发表于 2025-3-22 15:43:58 | 显示全部楼层
Uniform Diagonalization,m. It allows one to prove the existence of non-complete sets in . — ., provided that . ≠ .. We will show also, using this theorem, that under the same hypothesis infinite hierarchies of incomparable sets (with respect to polynomial time reducibilities) exist in . — .. This theorem allows the origina
发表于 2025-3-22 18:58:18 | 显示全部楼层
Textbook 1995Latest edition this volume at the same basic level that it had in the first edition, and the only new result incorporated as an appendix is the closure under complementation of nondeterministic space classes, which in the previous edition was posed as an open problem. This result was already included in our Volum
发表于 2025-3-22 21:24:47 | 显示全部楼层
Time and Space Bounded Computations,sets and classes of sets, and that these first two chapters are included for the sake of completeness. Readers interested in pursuing the specific topics treated in these two chapters are referred to the books indicated in the bibliographical remarks.
发表于 2025-3-23 03:18:51 | 显示全部楼层
发表于 2025-3-23 05:34:38 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-22 20:28
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表