找回密碼
 To register

QQ登錄

只需一步,快速開始

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

打印 上一主題 下一主題

Titlebook: People, Problems, and Proofs; Essays from G?del‘s Richard J. Lipton,Kenneth W. Regan Book 2013 Springer-Verlag Berlin Heidelberg 2013 Algo

[復制鏈接]
查看: 34138|回復: 35
樓主
發(fā)表于 2025-3-21 19:02:43 | 只看該作者 |倒序瀏覽 |閱讀模式
書目名稱People, Problems, and Proofs
副標題Essays from G?del‘s
編輯Richard J. Lipton,Kenneth W. Regan
視頻videohttp://file.papertrans.cn/744/743490/743490.mp4
概述Unique breadth of examples from the history of computer science and mathematics.Offers tips and inspiration to graduate students.Authors very experienced at communicating the essence of difficult prob
圖書封面Titlebook: People, Problems, and Proofs; Essays from G?del‘s  Richard J. Lipton,Kenneth W. Regan Book 2013 Springer-Verlag Berlin Heidelberg 2013 Algo
描述.People, problems, and proofs are the lifeblood of theoretical computer science. Behind the computing devices and applications that have transformed our lives are clever algorithms, and for every worthwhile algorithm there is a problem that it solves and a proof that it works. Before this proof there was an open problem: can one create an efficient algorithm to solve the computational problem? And, finally, behind these questions are the people who are excited about these fundamental issues in our computational world. .In this book the authors draw on their outstanding research and teaching experience to showcase some key people and ideas in the domain of theoretical computer science, particularly in computational complexity and algorithms, and related mathematical topics. They show evidence of the considerable scholarship that supports this young field, and they balance an impressive breadth of topics with the depth necessary to reveal the power and the relevance of the work described. .Beyond this, the authors discuss the sustained effort of their community, revealing much about the culture of their field. A career in theoretical computer science at the top level is a vocation: t
出版日期Book 2013
關鍵詞Algorithms; Chess; Complexity theory; Computational complexity; Computer science teaching; Cryptology; Gra
版次1
doihttps://doi.org/10.1007/978-3-642-41422-0
isbn_softcover978-3-662-52301-8
isbn_ebook978-3-642-41422-0
copyrightSpringer-Verlag Berlin Heidelberg 2013
The information of publication is updating

書目名稱People, Problems, and Proofs影響因子(影響力)




書目名稱People, Problems, and Proofs影響因子(影響力)學科排名




書目名稱People, Problems, and Proofs網絡公開度




書目名稱People, Problems, and Proofs網絡公開度學科排名




書目名稱People, Problems, and Proofs被引頻次




書目名稱People, Problems, and Proofs被引頻次學科排名




書目名稱People, Problems, and Proofs年度引用




書目名稱People, Problems, and Proofs年度引用學科排名




書目名稱People, Problems, and Proofs讀者反饋




書目名稱People, Problems, and Proofs讀者反饋學科排名




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

0票 0%

Perfect with Aesthetics

 

0票 0%

Better Implies Difficulty

 

0票 0%

Good and Satisfactory

 

0票 0%

Adverse Performance

 

0票 0%

Disdainful Garbage

您所在的用戶組沒有投票權限
沙發(fā)
發(fā)表于 2025-3-21 23:38:42 | 只看該作者
第143490主題貼--第2樓 (沙發(fā))
板凳
發(fā)表于 2025-3-22 01:58:34 | 只看該作者
板凳
地板
發(fā)表于 2025-3-22 06:31:17 | 只看該作者
第4樓
5#
發(fā)表于 2025-3-22 09:18:42 | 只看該作者
5樓
6#
發(fā)表于 2025-3-22 13:02:34 | 只看該作者
6樓
7#
發(fā)表于 2025-3-22 20:39:01 | 只看該作者
7樓
8#
發(fā)表于 2025-3-22 21:14:14 | 只看該作者
8樓
9#
發(fā)表于 2025-3-23 03:18:41 | 只看該作者
9樓
10#
發(fā)表于 2025-3-23 06:27:51 | 只看該作者
10樓
 關于派博傳思  派博傳思旗下網站  友情鏈接
派博傳思介紹 公司地理位置 論文服務流程 影響因子官網 吾愛論文網 大講堂 北京大學 Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點評 投稿經驗總結 SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學 Yale Uni. Stanford Uni.
QQ|Archiver|手機版|小黑屋| 派博傳思國際 ( 京公網安備110108008328) GMT+8, 2025-10-8 08:46
Copyright © 2001-2015 派博傳思   京公網安備110108008328 版權所有 All rights reserved
快速回復 返回頂部 返回列表
响水县| 庆元县| 通榆县| 岐山县| 铁岭县| 广灵县| 靖宇县| 德州市| 乐至县| 兴义市| 修文县| 石渠县| 凭祥市| 平远县| 武城县| 鸡西市| 右玉县| 禄劝| 安图县| 新河县| 腾冲县| 益阳市| 舒兰市| 庆城县| 赫章县| 壶关县| 成武县| 六枝特区| 浦城县| 大埔区| 芦山县| 昔阳县| 宿迁市| 修文县| 施秉县| 商洛市| 台南市| 博客| 阿鲁科尔沁旗| 越西县| 田林县|