Open-Awesome
CategoriesAlternativesStacksSelf-HostedExplore
Open-Awesome

© 2026 Open-Awesome. Curated for the developer elite.

TermsPrivacyAboutGitHubRSS
  1. Home
  2. Theoretical Computer Science
  3. Demaine, Gasarch & Hajiaghayi. Computers and Intractability: A Guide to Algorithmic Lower Bounds

Demaine, Gasarch & Hajiaghayi. Computers and Intractability: A Guide to Algorithmic Lower Bounds

Visit WebsiteGitHubGitHub
0 stars0 forks0 contributors

Overview

A sequel to Garey and Johnson's Computers and Intractability: A Guide to NP-Completeness. New topics include Parameterized Complexity, Lower bounds on approximation, Other hardness assumptions (ETH, 3SUM-conjecture, APSP-conjecture, UGC, Others), Online Algorithms, Streaming Algorithms, Polynomial Parity Arguments, and Parallelism

Quick Stats

Stars0
Forks0
Contributors0
Open Issues0
Last commit
Created

Links & Resources

Website

Included in

Theoretical Computer Science1.1k

Related Projects

Demaine. Games, Puzzles, and ComputationDemaine. Games, Puzzles, and Computation

It shows that games and puzzles can serve as powerful models of computation, Offering a new way of thinking about computation

Stars0
Forks0
Last commit
Community-curated · Updated weekly · 100% open source

Found a gem we're missing?

Open-Awesome is built by the community, for the community. Submit a project, suggest an awesome list, or help improve the catalog on GitHub.

Submit a projectStar on GitHub