MIT OpenCourseWare
open access
CC BY-NC-SA
Algorithmic Lower Bounds: Fun with Hardness Proofs
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- 150+1 Probleme (și soluțiile lor) / 150+1 Problems (and their solutions).#111835
- Progress in Benchmarking Generics for Mathematical Computation#411118
- Maximum Matching-Match: Hardness and Approximation#975248
- Combinatorial Optimization#66996
- Planning to Hammer: Difficulty-Aware Decomposition for Automating Rocq Proofs#282847
Record · ID 3416
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive