000 01407cam a22003497i 4500
999 _c30091
_d30091
003 CUTN
005 20190823121851.0
008 140325s2014 flua b 001 0 eng
020 _a9781439825648 (hardback : alk. paper)
020 _a1439825645 (hardback : alk. paper)
041 _aEnglish
042 _alccopycat
082 0 4 _a005.1
_223
_bBEN
100 1 _aBenoit, Anne,
245 1 2 _aA guide to algorithm design :
_bparadigms, methods, and complexity analysis /
_cAnne Benoit, Yves Robert, and Frédérick Vivien.
260 _aBoca Raton :
_bCRC Press,
_c [2014] ©2014
300 _axvii, 362 pages :
_billustrations ;
_c25 cm.
440 _aChapman & Hall/CRC applied algorithms and data structures series.
505 _tPart I: Polynomial-time algorithms: Exercises
_tPart II: NP- completeness and beyond
_tPart III: Reasoning on Problem Complexity
650 0 _aComputer algorithms.
650 0 _aComputational complexity.
700 1 _aRobert, Yves,
700 1 _aVivien, Frédéric,
942 _2ddc
_cBOOKS
100 1 _eauthor.
490 0 _aChapman & Hall/CRC applied algorithms and data structures series
504 _aIncludes bibliographical references and index.
700 1 _d1938-,
_eauthor.
700 1 _eauthor.
906 _a7
_bcbc
_ccopycat
_d2
_encip
_f20
_gy-gencatlg