注冊 | 登錄讀書好,好讀書,讀好書!
讀書網(wǎng)-DuShu.com
當(dāng)前位置: 首頁出版圖書科學(xué)技術(shù)計算機/網(wǎng)絡(luò)計算機科學(xué)理論與基礎(chǔ)知識離散數(shù)學(xué)(基礎(chǔ)與提高影印版)

離散數(shù)學(xué)(基礎(chǔ)與提高影印版)

離散數(shù)學(xué)(基礎(chǔ)與提高影印版)

定 價:¥39.00

作 者: 羅瓦茨、培理肯、維斯特岡比
出版社: 清華大學(xué)出版社
叢編項:
標(biāo) 簽: 離散數(shù)學(xué)

ISBN: 9787302138266 出版時間: 2006-09-01 包裝: 平裝
開本: 16 頁數(shù): 290 字?jǐn)?shù):  

內(nèi)容簡介

  本書包括組合、圖論及它們在優(yōu)化和編碼等領(lǐng)域的應(yīng)用。全書只有約30(J頁,但涵蓋了信息領(lǐng)域一些廣泛而有趣的應(yīng)用,及離散數(shù)學(xué)領(lǐng)域新穎而前沿的研究課題。本書非常適合計算機科學(xué)、信息與計算科學(xué)等專業(yè)作為"離散數(shù)學(xué)"引論課程的教材或參考書。

作者簡介

暫缺《離散數(shù)學(xué)(基礎(chǔ)與提高影印版)》作者簡介

圖書目錄

Preface
1 Let s Count!
1.1 A Party
1.2 Sets and the Like
1.3 The Nunmber of Subsets
1.4 The Approximate Number of Subsets
1.5 Sequences
1.6 Permutations
1.7 The Number of Ordered Subsets
1.8 The Number of Subsets of a Given Size
2 Combinatorial Tools
2.1 Induction
2.2 Comparing and Estimationg numbers
2.3 Inclusion-Exclusion
2.4 Pigeonholes
2.5 The Twin Paradox and the Good Old Logarithm
3 Binomial Coefficients and Pascal s Triangle
3.1 The Binomial Theorem
3.2 Distributing Presents
3.3 Anagrams
3.4 Distributing Money
3.5 Pascal s Trianglc
3.6 Identities in pascal s Triangle
3.7 A Bird s -Eye View of Pascal s Triangle
3.8 All Eagle s -Eye View:Fine Details
4 Fibonacci Numbers
4.1 Fibonacci s Exercise
4.2 Lots of Identities
4.3 A Formula for the Fibonacci Nunbers
5 Combinatorial Probability
5.1 Events and Probabilities
5.2 Independent Repetition of an Experiment
5.3 The Law of Large Numbers
5.4 The Law of Small Numbers and t he Law of Very Large Nmmbers
6 Integers,Divisors and Primes
6.1 Divisibility of Integers
6.2 Primes and Their History
6.3 Factorization into Primes
6.4 On the Set of primes
6.5 Fermat s Little Theorem
6.6 The Fuclidean lgorithm
6.7 Congruences
6.8 Strange Numbers
6.9 Nunber Theory and Combiatorics
6.10 How to Test Whether a Number is a Prime?
7 Graphs
7.1 Even and Odd Dergrees
7.2 Paths Cycles and Connectivitry
7.3 Eulerian Walkd and Hamiltnian Cycles
8 Trees
8.1 How to Define Trees
8.2 How to Grow Trees
8.3 HOw to Count Trees?
8.4 How to Store Trees
8.5 The Number of Unlabeled Trees
9 Finding the Optimum
9.1 Finding the Best Tree
9.2 The Traveling Salesman Problem
10 Matvchings in Graphs
10.1 A Dancing Problem
……
11 Combinatorics in Geometry
12 Euler s Formula
13 Coloring Maps and Graphs
14 Finite Geometries,Codes,Latin Squares,and Other Pretty Creatures
15 A Glimpse of COmplexity and Cryptography
16 Answers to Exercises
Index

本目錄推薦

掃描二維碼
Copyright ? 讀書網(wǎng) www.talentonion.com 2005-2020, All Rights Reserved.
鄂ICP備15019699號 鄂公網(wǎng)安備 42010302001612號