找回密碼
 To register

QQ登錄

只需一步,快速開始

掃一掃,訪問微社區(qū)

打印 上一主題 下一主題

Titlebook: Randomness and Completeness in Computational Complexity; Dieter Melkebeek Book 2000 Springer-Verlag Berlin Heidelberg 2000 Algorithms.Comp

[復(fù)制鏈接]
查看: 24696|回復(fù): 42
樓主
發(fā)表于 2025-3-21 16:34:26 | 只看該作者 |倒序?yàn)g覽 |閱讀模式
書目名稱Randomness and Completeness in Computational Complexity
編輯Dieter Melkebeek
視頻videohttp://file.papertrans.cn/822/821126/821126.mp4
概述Includes supplementary material:
叢書名稱Lecture Notes in Computer Science
圖書封面Titlebook: Randomness and Completeness in Computational Complexity;  Dieter Melkebeek Book 2000 Springer-Verlag Berlin Heidelberg 2000 Algorithms.Comp
描述This book contains a revised version of the dissertation the author wrote at the Department of Computer Science of the University of Chicago. The thesis was submitted to the Faculty of Physical Sciences in conformity with the requirements for the PhD degree in June 1999. It was honored with the 1999 ACM Doctoral Dissertation Award in May 2000. Summary Computational complexity is the study of the inherent di culty of compu- tional problems and the power of the tools we may use to solve them. It aims to describe how many resources we need to compute the solution as a function of the problem size. Typical resources include time on sequential and parallel architectures and memory space. As we want to abstract away from details of input representation and speci cs of the computer model, we end up with classes of problems that we can solve within certain robust resource bounds such as polynomial time, parallel logarithmic time, and logarithmic space. Research in complexity theory boils down to determining the relationships between these classes { inclusions and separations. In this dissertation, we focus on the role of randomness and look at various properties of hard problems in order t
出版日期Book 2000
關(guān)鍵詞Algorithms; Complete Languages; Completeness; Complexity Theory; Computational Complexity; Formal Languag
版次1
doihttps://doi.org/10.1007/3-540-44545-5
isbn_softcover978-3-540-41492-6
isbn_ebook978-3-540-44545-6Series ISSN 0302-9743 Series E-ISSN 1611-3349
issn_series 0302-9743
copyrightSpringer-Verlag Berlin Heidelberg 2000
The information of publication is updating

書目名稱Randomness and Completeness in Computational Complexity影響因子(影響力)




書目名稱Randomness and Completeness in Computational Complexity影響因子(影響力)學(xué)科排名




書目名稱Randomness and Completeness in Computational Complexity網(wǎng)絡(luò)公開度




書目名稱Randomness and Completeness in Computational Complexity網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Randomness and Completeness in Computational Complexity被引頻次




書目名稱Randomness and Completeness in Computational Complexity被引頻次學(xué)科排名




書目名稱Randomness and Completeness in Computational Complexity年度引用




書目名稱Randomness and Completeness in Computational Complexity年度引用學(xué)科排名




書目名稱Randomness and Completeness in Computational Complexity讀者反饋




書目名稱Randomness and Completeness in Computational Complexity讀者反饋學(xué)科排名




單選投票, 共有 1 人參與投票
 

1票 100.00%

Perfect with Aesthetics

 

0票 0.00%

Better Implies Difficulty

 

0票 0.00%

Good and Satisfactory

 

0票 0.00%

Adverse Performance

 

0票 0.00%

Disdainful Garbage

您所在的用戶組沒有投票權(quán)限
沙發(fā)
發(fā)表于 2025-3-21 20:39:20 | 只看該作者
板凳
發(fā)表于 2025-3-22 03:51:58 | 只看該作者
978-3-540-41492-6Springer-Verlag Berlin Heidelberg 2000
地板
發(fā)表于 2025-3-22 06:20:54 | 只看該作者
5#
發(fā)表于 2025-3-22 09:59:28 | 只看該作者
1. Introduction,How can we solve a problem using computers in a reasonable amount of time? Computational complexity studies the inherent difficulty of problems and the power of the tools we may engage to solve them.
6#
發(fā)表于 2025-3-22 14:49:45 | 只看該作者
5. Autoreducibility of Complete Languages,This chapter looks at another property of complete languages that allows us to separate complexity classes, namely their redundancy. We will investigate a very general notion of redundancy, known as autoreducibility.
7#
發(fā)表于 2025-3-22 17:41:24 | 只看該作者
7. The Frequency of Complete Languages,In this chapter, we look at the frequency of complete languages as a tool to separate complexity classes.
8#
發(fā)表于 2025-3-22 23:17:04 | 只看該作者
Dieter MelkebeekIncludes supplementary material:
9#
發(fā)表于 2025-3-23 03:44:23 | 只看該作者
10#
發(fā)表于 2025-3-23 08:40:26 | 只看該作者
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點(diǎn)評 投稿經(jīng)驗(yàn)總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-21 11:58
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
奉贤区| 平利县| 独山县| 工布江达县| 招远市| 乐陵市| 门源| 武清区| 上饶市| 深圳市| 宁津县| 商都县| 依兰县| 湾仔区| 台北县| 萨嘎县| 黄陵县| 崇阳县| 杭锦后旗| 白沙| 遵义县| 济宁市| 瓦房店市| 普定县| 泊头市| 加查县| 信丰县| 甘洛县| 新巴尔虎右旗| 安康市| 离岛区| 共和县| 兰西县| 佛冈县| 鄢陵县| 米易县| 乡城县| 汝阳县| 凌云县| 保靖县| 湖北省|