找回密碼
 To register

QQ登錄

只需一步,快速開始

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

打印 上一主題 下一主題

Titlebook: Data Structures and Algorithms 1; Sorting and Searchin Kurt Mehlhorn Textbook 1984 Springer-Verlag Berlin Heidelberg 1984 NP-completeness.S

[復制鏈接]
查看: 26336|回復: 35
樓主
發(fā)表于 2025-3-21 18:14:30 | 只看該作者 |倒序瀏覽 |閱讀模式
書目名稱Data Structures and Algorithms 1
副標題Sorting and Searchin
編輯Kurt Mehlhorn
視頻videohttp://file.papertrans.cn/264/263161/263161.mp4
叢書名稱Monographs in Theoretical Computer Science. An EATCS Series
圖書封面Titlebook: Data Structures and Algorithms 1; Sorting and Searchin Kurt Mehlhorn Textbook 1984 Springer-Verlag Berlin Heidelberg 1984 NP-completeness.S
描述The design and analysis of data structures and efficient algorithms has gained considerable importance in recent years. The concept of "algorithm" is central in computer science, and "efficiency" is central in the world of money. I have organized the material in three volumes and nine chapters. Vol. 1: Sorting and Searching (chapters I to III) Vol. 2: Graph Algorithms and NP-completeness (chapters IV to VI) Vol. 3: Multi-dimensional Searching and Computational G- metry (chapters VII and VIII) Volumes 2 and 3 have volume 1 as a common basis but are indepen- dent from each other. Most of volumes 2 and 3 can be understood without knowing volume 1 in detail. A general kowledge of algorith- mic principles as laid out in chapter 1 or in many other books on algorithms and data structures suffices for most parts of volumes 2 and 3. The specific prerequisites for volumes 2 and 3 are listed in the prefaces to these volumes. In all three volumes we present and analyse many important efficient algorithms for the fundamental computa- tional problems in the area. Efficiency is measured by the running time on a realistic model of a computing machine which we present in chapter I. Most of the algo
出版日期Textbook 1984
關鍵詞NP-completeness; Structures; algorithms; computer; computer science; data structures; sorting; algorithm an
版次1
doihttps://doi.org/10.1007/978-3-642-69672-5
isbn_softcover978-3-642-69674-9
isbn_ebook978-3-642-69672-5Series ISSN 1431-2654 Series E-ISSN 2193-2069
issn_series 1431-2654
copyrightSpringer-Verlag Berlin Heidelberg 1984
The information of publication is updating

書目名稱Data Structures and Algorithms 1影響因子(影響力)




書目名稱Data Structures and Algorithms 1影響因子(影響力)學科排名




書目名稱Data Structures and Algorithms 1網(wǎng)絡公開度




書目名稱Data Structures and Algorithms 1網(wǎng)絡公開度學科排名




書目名稱Data Structures and Algorithms 1被引頻次




書目名稱Data Structures and Algorithms 1被引頻次學科排名




書目名稱Data Structures and Algorithms 1年度引用




書目名稱Data Structures and Algorithms 1年度引用學科排名




書目名稱Data Structures and Algorithms 1讀者反饋




書目名稱Data Structures and Algorithms 1讀者反饋學科排名




單選投票, 共有 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:58:30 | 只看該作者
板凳
發(fā)表于 2025-3-22 03:21:09 | 只看該作者
Textbook 1984 prefaces to these volumes. In all three volumes we present and analyse many important efficient algorithms for the fundamental computa- tional problems in the area. Efficiency is measured by the running time on a realistic model of a computing machine which we present in chapter I. Most of the algo
地板
發(fā)表于 2025-3-22 07:37:10 | 只看該作者
Sets,ers and digits of some bounded length, say at most length 6. Then the number of possible identifiers is 6 9 (26 + 10). ∈ 10.; in every program only a small subset of the set of all possible identifiers is used. Set ST is small compared to the very large universe of all possible identifiers.
5#
發(fā)表于 2025-3-22 10:53:57 | 只看該作者
6#
發(fā)表于 2025-3-22 16:15:56 | 只看該作者
Evandro Fonseca,Aline Vanin,Renata Vieiraon problem we can define size as the sum of the lengths of the decimal representations of the factors (6 in our example). Although the definition of size is arbitrary, there is usually a natural choice.
7#
發(fā)表于 2025-3-22 19:26:34 | 只看該作者
Foundations,on problem we can define size as the sum of the lengths of the decimal representations of the factors (6 in our example). Although the definition of size is arbitrary, there is usually a natural choice.
8#
發(fā)表于 2025-3-22 23:13:53 | 只看該作者
9#
發(fā)表于 2025-3-23 02:54:52 | 只看該作者
Foundations,m P consists of infinitely problem instances. An instance of the maximum problem is e.g. to compute the maximum of the following set of 5 numbers 2,7,3,9,8. An instance of the multiplication problem is e.g. to compute the product of 257 and 123. We associate with every problem instance p ∈ P a natur
10#
發(fā)表于 2025-3-23 05:33:15 | 只看該作者
 關于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學 Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點評 投稿經(jīng)驗總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學 Yale Uni. Stanford Uni.
QQ|Archiver|手機版|小黑屋| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-6 07:28
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權所有 All rights reserved
快速回復 返回頂部 返回列表
金寨县| 安康市| 中西区| 五河县| 巴青县| 响水县| 从江县| 新晃| 明溪县| 滕州市| 孟津县| 邹平县| 宿松县| 环江| 丹巴县| 邓州市| 清徐县| 平罗县| 广水市| 松溪县| 古交市| 岳阳市| 论坛| 天台县| 陆河县| 叶城县| 金山区| 大理市| 抚松县| 项城市| 措美县| 武清区| 东台市| 张家港市| 辽宁省| 中阳县| 准格尔旗| 大兴区| 九龙城区| 右玉县| 湾仔区|