Entrar
    Book cover
    Compartilhar
    Editar
    • Sinopse
    • Edições0
    • Vídeos0
    • Grupos0
    • Resenhas0
    • Leitores43
    • Similares0
    Skoob logo

    Saiba mais

    Quem somosTermos de usoFale conoscoCentral de ajudaPrivacidade

    Fique por dentro

    Livros em destaque

    Explore

    LivrosAutoresEditorasLeitoresCortesias

    Siga nas redes sociais

    Baixe o app

    Google PlayApp Store

    The Art of Computer Programming, Volume 4A - Combinatorial Algorithms, Part 1

    Donald E. Knuth

    Addison-Wesley Professional
    2011
    912 páginas
    1d 6h 24m
    ISBN-13: 9780321751041
    0
    0 avaliação
    Leram2Lendo2Querem39Relendo0Abandonos0Resenhas0
    Favoritos0Desejados39Avaliaram0

    In this long-awaited new volume, the old master turns his attention to some of his favorite topics in broadword computation and combinatorial generation (exhaustively listing fundamental combinatorial objects, such as permutations, partitions, and trees), as well as his more recent interests, such as binary decision diagrams. The hallmark qualities that distinguish his previous volumes are manifest here anew: detailed coverage of the basics, illustrated with well-chosen examples; occasional forays into more esoteric topics and problems at the frontiers of research; impeccable writing peppered with occasional bits of humor; extensive collections of exercises, all with solutions or helpful hints; a careful attention to history; implementations of many of the algorithms in his classic step-by-step form. There is an amazing amount of information on each page. Knuth has obviously thought long and hard about which topics and results are most central and important, and then, what are the most intuitive and succinct ways of presenting that material. Since the areas that he covers in this volume have exploded since he first envisioned writing about them, it is wonderful how he has managed to provide such thorough treatment in so few pages. —Frank Ruskey, Department of Computer Science, University of Victoria The book is Volume 4A, because Volume 4 has itself become a multivolume undertaking. Combinatorial searching is a rich and important topic, and Knuth has too much to say about it that is new, interesting, and useful to fit into a single volume, or two, or maybe even three. This book alone includes approximately 1500 exercises, with answers for self-study, plus hundreds of useful facts that cannot be found in any other publication. Volume 4A surely belongs beside the first three volumes of this classic work in every serious programmer’s library.

    Estatísticas

    Avaliações

    0 / 0
    • 5 estrelas0%
    • 4 estrelas0%
    • 3 estrelas0%
    • 2 estrelas0%
    • 1 estrelas0%
    Donald E. Knuth profile picture

    Donald E. Knuth

    Donald Ervin Knuth (/kəˈnuːθ/[3] kə-NOOTH; born January 10, 1938) is an American computer scientist, mathematician, and professor emeritus at Stanford University. He is the 1974 recipient of the ACM Turing Award, informally considered the Nobel Prize of computer science.[4] Knuth has been called the "father of the analysis of algorithms".[5] He is the author of the multi-volume work The Art of Computer Programming and contributed to the development of the rigorous analysis of the computational complexity of algorithms and systematized formal mathematical techniques for it. In the process, he also popularized the asymptotic notation. In addition to fundamental contributions in several branches of theoretical computer science, Knuth is the creator of the TeX computer typesetting system, the related METAFONT font definition language and rendering system, and the Computer Modern family of typefaces. Wikipedia contributors. "Donald Knuth." Wikipedia, The Free Encyclopedia. Wikipedia, The Free Encyclopedia, 26 Oct. 2022. Web. 28 Oct. 2022.

    8 Livros
    3 Seguidores
    Wisconsin, American

    Donald E. Knuth