Downloads
How to think about algorithms
Edmonds, Jeff, 1963 · Cambridge New York : Cambridge University Press, 2008
- Publisher
- Cambridge New York : Cambridge University Press, 2008
- Physical description
- 1 pages
- ISBN
- 0511412789 (ebook);051141370X (ebook);9780511412783 (ebook);9780511413704 (ebook)
- Dewey classification
- 518.1
- Subjects
- Algorithms--Study and teachingInvariants--Study and teachingLoops (Group theory)--Study and teachingRecursion theory--Study and teaching
- Language
- English
Digital copy
Full textPDF · reads in your browser
Sign-in requiredRead
Catalogue record
| Field | Value |
|---|---|
| 001Control number | 17959 |
| 003Control number identifier | OCoLC |
| 005Date and time of latest transaction | 27 Dec 2010, 09:03 |
| 006Fixed-length data elements – additional material characteristics | m d |
| 007Physical description fixed field | cr mn||||||||| |
| 008Fixed-length data elements | 090320s2008 enka s 001 0 eng d |
| 020International Standard Book Number (ISBN) |
|
| 035System control number | (OCoLC)316543869 |
| 040Cataloging source | OSU OSU ORE |
| 041Language code | eng |
| 082Dewey Decimal call number | 518.1 How-A |
| 090Local call number |
|
| 100Main entry – personal name | Edmonds, Jeff, 1963- |
| 245Title statement | How to think about algorithms [electronic resource] / Jeff Edmonds. |
| 260Publication, distribution, etc. (imprint) | Cambridge ; New York : Cambridge University Press, 2008 |
| 300Physical description | 1 online resource (xiii, 448 p.) : ill. |
| 500General note |
|
| 505Formatted contents note | Iterative algorithms: measures of progress and loop invariants -- Examples using more-of-the-input loop invariants -- Abstract data types -- Narrowing the search space: binary search -- Iterative sorting algorithms -- Euclid's GCD algorithm -- The loop invariant for lower bounds -- Abstractions, techniques, and theory -- Some simple examples of recursive algorithms -- Recursion on trees -- Recursive images -- Parsing with context-free grammars -- Definition of optimization problems -- Graph search algorithms -- Network flows and linear programming -- Greedy algorithms -- Recursive backtracking -- Dynamic programming algorithms -- Examples of dynamic programs -- Reductions and NP-completeness -- Randomized algorithms -- Existential and universal quantifiers -- Time complexity -- Logarithms and exponentials -- Asymptotic growth -- Adding-made-easy approximations -- Recurrence relations -- A formal proof of correctness. |
| 650Subject added entry – topical term |
|
| 776Additional physical form entry | Print version : Edmonds, Jeff, 1963- How to think about algorithms. Cambridge ; New York : Cambridge University Press, 2008 9780521849319 (DLC) 2008001238 (OCoLC)190843470. |
| 999Collection | Downloads |
=001 17959=003 OCoLC=005 20101227090320.0=006 m d=007 cr mn|||||||||=008 090320s2008 enka s 001 0 eng d=020 ##$a0511412789 (ebook)=020 ##$a051141370X (ebook)=020 ##$a9780511412783 (ebook)=020 ##$a9780511413704 (ebook)=020 ##$z0521614104 (pbk.)=020 ##$z0521849314 (hardback)=020 ##$z9780521614108 (pbk.)=020 ##$z9780521849319 (hardback)=035 ##$a(OCoLC)316543869=040 ##$aOSU $cOSU $dORE=041 0#$aeng=049 ##$aOREU=082 ##$a518.1 $bHow-A=090 ##$aQA9.58 $b.E36 2008eb=090 ##$aQA9.58 $b.E36 2008eb=100 1#$aEdmonds, Jeff, $d1963-=245 10$aHow to think about algorithms $h[electronic resource] / $cJeff Edmonds.=260 ##$aCambridge ; $aNew York : $bCambridge University Press, $c2008=300 ##$a1 online resource (xiii, 448 p.) : $bill.=500 ##$aDescription based on print version record.=500 ##$aIncludes index.=505 0#$aIterative algorithms: measures of progress and loop invariants -- Examples using more-of-the-input loop invariants -- Abstract data types -- Narrowing the search space: binary search -- Iterative sorting algorithms -- Euclid's GCD algorithm -- The loop invariant for lower bounds -- Abstractions, techniques, and theory -- Some simple examples of recursive algorithms -- Recursion on trees -- Recursive images -- Parsing with context-free grammars -- Definition of optimization problems -- Graph search algorithms -- Network flows and linear programming -- Greedy algorithms -- Recursive backtracking -- Dynamic programming algorithms -- Examples of dynamic programs -- Reductions and NP-completeness -- Randomized algorithms -- Existential and universal quantifiers -- Time complexity -- Logarithms and exponentials -- Asymptotic growth -- Adding-made-easy approximations -- Recurrence relations -- A formal proof of correctness.=650 #0$aAlgorithms $xStudy and teaching.=650 #0$aInvariants $xStudy and teaching.=650 #0$aLoops (Group theory) $xStudy and teaching.=650 #0$aRecursion theory $xStudy and teaching.=776 08$iPrint version : $aEdmonds, Jeff, 1963- $tHow to think about algorithms. $dCambridge ; New York : Cambridge University Press, 2008 $z9780521849319 $w(DLC) 2008001238 $w(OCoLC)190843470.=907 ##$b25540403=LDR 02546cam a2200469Ia 4500