“2012级--指定教材”的版本间的差异
来自问题求解
| （未显示同一用户的11个中间版本） | |||
| 第1行： | 第1行： | ||
| − | |||
<ul> | <ul> | ||
| − | <li>'''CS''': Cliff Stein et al.: Discrete Mathematics for Computer Scientists. Addison-Wesley, 2010</li> | + | <li>'''CS''': Cliff Stein et al.: Discrete Mathematics for Computer Scientists, 1st ed. Addison-Wesley, 2010</li> |
<li>'''DH''': David Harel et al.: Algorithmics - The Spirit of Computing, 3rd ed. Addison-Wesley, 2004</li> | <li>'''DH''': David Harel et al.: Algorithmics - The Spirit of Computing, 3rd ed. Addison-Wesley, 2004</li> | ||
<li>'''DW''': Douglas West: Introduction to Graph Theory, 2nd ed. Pearson, 2000</li> | <li>'''DW''': Douglas West: Introduction to Graph Theory, 2nd ed. Pearson, 2000</li> | ||
| − | <li>'''ES''': Edward Scheinerman: Mathematics - A Discrete Introduction, 2nd ed. Brooks Cole, 2005 | + | <li>'''ES''': Edward Scheinerman: Mathematics - A Discrete Introduction, 2nd ed. Brooks/Cole, 2005 (第24节：鸽巢原理)</li> |
| − | <li>'''JH''': Juraj Hromkovic: Algorithmics for Hard Problems - Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics, 2nd ed. Springer, | + | <li>'''JH''': Juraj Hromkovic: Algorithmics for Hard Problems - Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics, 2nd ed. Springer, 2004</li> |
| + | <li>'''SB''': Sara Baase et al.: Computer Algorithms - Introduction to Design and Analysis, 3rd ed. Addison-Wesley, 1999 (第2章：抽象数据类型)</li> | ||
<li>'''TC''': Thomas Cormen: Introduction to Algorithms, 3rd ed. MIT, 2009</li> | <li>'''TC''': Thomas Cormen: Introduction to Algorithms, 3rd ed. MIT, 2009</li> | ||
<li>'''TJ''': Thomas Judson: Abstract Algebra - Theory and Applications, http://abstract.ups.edu/</li> | <li>'''TJ''': Thomas Judson: Abstract Algebra - Theory and Applications, http://abstract.ups.edu/</li> | ||
| − | <li>'''UD''': Ulrich Daepp et al.: Reading, Writing, and Proving - A Closer Look at Mathematics. 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> | ||
2014年1月4日 (六) 11:21的最新版本
- 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, 2004
- SB: Sara Baase et al.: Computer Algorithms - Introduction to Design and Analysis, 3rd ed. Addison-Wesley, 1999 (第2章：抽象数据类型)
- 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
