“2012级--指定教材”的版本间的差异
来自问题求解
| 第1行： | 第1行： | ||
| − | |||
<ul> | <ul> | ||
<li>'''CS''': Cliff Stein et al.: Discrete Mathematics for Computer Scientists, 1st ed. Addison-Wesley, 2010</li> | <li>'''CS''': Cliff Stein et al.: Discrete Mathematics for Computer Scientists, 1st ed. Addison-Wesley, 2010</li> | ||
| 第10行： | 第9行： | ||
<li>'''UD''': Ulrich Daepp et al.: Reading, Writing, and Proving - A Closer Look at Mathematics, 1st ed. Springer, 2003</li> | <li>'''UD''': Ulrich Daepp et al.: Reading, Writing, and Proving - A Closer Look at Mathematics, 1st ed. Springer, 2003</li> | ||
<li>'''WS''': Walter Savitch: Problem Solving with C++, 7th ed. Addison Wesley, 2008</li> | <li>'''WS''': Walter Savitch: Problem Solving with C++, 7th ed. Addison Wesley, 2008</li> | ||
| − | |||
| − | |||
| − | |||
| − | |||
</ul> | </ul> | ||
2012年9月20日 (四) 13:54的版本
- CS: Cliff Stein et al.: Discrete Mathematics for Computer Scientists, 1st ed. Addison-Wesley, 2010
- DH: David Harel et al.: Algorithmics - The Spirit of Computing, 3rd ed. Addison-Wesley, 2004
- DW: Douglas West: Introduction to Graph Theory, 2nd ed. Pearson, 2000
- ES: Edward Scheinerman: Mathematics - A Discrete Introduction, 2nd ed. Brooks/Cole, 2005 (第24节鸽巢原理)
- JH: Juraj Hromkovic: Algorithmics for Hard Problems - Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics, 2nd ed. Springer, 2002
- TC: Thomas Cormen: Introduction to Algorithms, 3rd ed. MIT, 2009
- TJ: Thomas Judson: Abstract Algebra - Theory and Applications, http://abstract.ups.edu/
- UD: Ulrich Daepp et al.: Reading, Writing, and Proving - A Closer Look at Mathematics, 1st ed. Springer, 2003
- WS: Walter Savitch: Problem Solving with C++, 7th ed. Addison Wesley, 2008
