外部精选
软件工程
#开发者实时流Computational Intractability: A Guide to Algorithmic Lower Bounds
There will be typos, missing references, rough/missing figures,
Hacker News 最新matteodelabre2026/10/28 · 3 天前1 分钟阅读
以下正文同步自 Hacker News 最新，版权归原站所有，已转换为易读排版。
This is a draft of the book. There will be typos, missing references, rough/missing figures, and other mistakes. Please help us find them!
Send comments and suggestions for improvements to hardness-book@mit.edu.
Copyright in this work has been licensed exclusively to The MIT Press. All inquiries regarding rights should be addressed to the MIT Press, Rights and Permissions Department.
Video lectures about some of this book's material are available from the related class at MIT, 6.5440: Algorithmic Lower Bounds: Fun with Hardness Proofs.
正文由 探How 从来源站点 RSS 同步，内容未经改写；遇到排版缺失或需要图片、视频时请以原文为准。