독일 일반 면세 구매대행
임시 중단 안내
안녕하세요. 오마이집입니다.
더 나은 서비스를 위해
독일 일반 면세 구매대행 서비스를 임시 중단합니다.
새로운 모습으로 빠른 시일 내 다시 인사드리겠습니다.
감사합니다.
US
DE
498 Centerpoint Blvd
[사서함번호]
New Castle, DE, 19720
302-322-8792
* 항공운송만 가능
US
CA
2601 Walnut Ave
[사서함번호]
Tustin, CA, 92780
714-676-7274
* 해상운송만 가능
China
山东省威海市 环翠区 苘山镇
福州路9号 顺丰速递北20米
[사서함번호]
264414
156-8451-3564
* 항공&해상운송 가능
Germany
WarpEx [사서함번호]
Carl-Benz Str. 35
Frankfurt am Main, Hessen, Deutschland
60386
0614-2482-9236
* 항공운송만 가능
Korea
서울시 강서구 마곡중앙6로 11 보타닉파크타워3 405호
[사서함번호]
07801
070-5228-2983
Japan
福岡県 福岡市東区
和白東1丁目16-15 HANIRO
[사서함번호]
811-0214
092-608-7642
* 해상운송만 가능
고객센터 알림
NO | 안내시간 | 수취인명 | 신청서번호 | 알림내용 |
---|
* 알림 내용을 클릭하면 해당 페이지로 이동합니다.
Delaware
$250.00
책 정보
출판사 | CRC Press |
---|---|
저자 | Vladimir A Dobrushkin |
판형 | Hardcover |
ISBN-10 | 1420068296 |
ISBN-13 | 9781420068290 |
발행일 | 2009/11/01 |
언어 | eng |
무게 (LB) | 3.5 |
주제 분류
책 소개
Explores the Impact of the Analysis of Algorithms on Many Areas within and beyond Computer Science
A flexible, interactive teaching format enhanced by a large selection of examples and exercises
Developed from the author's own graduate-level course, Methods in Algorithmic Analysis presents numerous theories, techniques, and methods used for analyzing algorithms. It exposes students to mathematical techniques and methods that are practical and relevant to theoretical aspects of computer science.
After introducing basic mathematical and combinatorial methods, the text focuses on various aspects of probability, including finite sets, random variables, distributions, Bayes' theorem, and Chebyshev inequality. It explores the role of recurrences in computer science, numerical analysis, engineering, and discrete mathematics applications. The author then describes the powerful tool of generating functions, which is demonstrated in enumeration problems, such as probabilistic algorithms, compositions and partitions of integers, and shuffling. He also discusses the symbolic method, the principle of inclusion and exclusion, and its applications. The book goes on to show how strings can be manipulated and counted, how the finite state machine and Markov chains can help solve probabilistic and combinatorial problems, how to derive asymptotic results, and how convergence and singularities play leading roles in deducing asymptotic information from generating functions. The final chapter presents the definitions and properties of the mathematical infrastructure needed to accommodate generating functions.
Accompanied by more than 1,000 examples and exercises, this comprehensive, classroom-tested text develops students' understanding of the mathematical methodology behind the analysis of algorithms. It emphasizes the important relation between continuous (classical) mathematics and discrete mathematics, which is the basis of computer science.
트래킹 도착 조회
조회
조회 결과가 없는 경우, 센터로 상품이 도착하지 않은 것이니 판매처로 문의해주시기 바랍니다.
배송신청서에 이미 입고처리가 된 건이나 미작성 입고로 안내된 건은 조회가 되지 않습니다.