思维导图备注

Algorithm Design - TARDOS
首页 收藏书籍 阅读记录
  • 书签 我的书签
  • 添加书签 添加书签 移除书签 移除书签

NP and Computational Intractability

浏览 7 扫码
  • 小字体
  • 中字体
  • 大字体
2022-02-24 00:27:32
请 登录 再阅读
上一篇:
下一篇:
  • 书签
  • 添加书签 移除书签
  • About the Authors
  • Contents
  • Preface
  • 1   Introduction: Some Representative Problems
  • Introduction: Some Representative Problems
  • 2   Basics of Algorithm Analysis
  • Basics of Algorithm Analysis
  • 3   Graphs
  • Graphs
  • 4   Greedy Algorithms
  • Greedy Algorithms
  • 4.6 Implementing Kruskal's Algorithm: The Union-Find Data Structure
  • 5   Divide and Conquer
  • Divide and Conquer
  • 6   Dynamic Programming
  • Dynamic Programming
  • 6.6 Sequence Alignment
  • 7   Network Flow
  • Network Flow
  • 7.8 Survey Design
  • 7.12 Baseball Elimination
  • 8   NP and Computational Intractability
  • NP and Computational Intractability
  • 8.7 Graph Coloring
  • 9   PSPACE: A Class of Problems beyond NP
  • PSPACE: A Class of Problems beyond NP
  • 10   Extending the Limits of Tractability
  • Extending the Limits of Tractability
  • 11   Approximation Algorithms
  • Approximation Algorithms
  • 12   Local Search
  • Local Search
  • 13   Randomized Algorithms
  • Randomized Algorithms
  • Example: Waiting for a First Success
  • 13.8 Randomized Caching
  • Epilogue: Algorithms That Run Forever
  • References
  • Index
暂无相关搜索结果！
    展开/收起文章目录

    二维码

    手机扫一扫，轻松掌上学

    《Algorithm Design - TARDOS》电子书下载

    请下载您需要的格式的电子书，随时随地，享受学习的乐趣！
    EPUB 电子书

    书签列表

      阅读记录

      阅读进度: 0.00% ( 0/0 ) 重置阅读进度