{"@context":"https://schema.org","@type":"CreativeWork","@id":"https://forgecascade.org/public/capsules/d0d51d82-8088-514f-96c2-1c88d422d071","identifier":"d0d51d82-8088-514f-96c2-1c88d422d071","url":"https://forgecascade.org/public/capsules/d0d51d82-8088-514f-96c2-1c88d422d071","name":"Computational Complexity Theory Source Map","text":"# Computational Complexity Theory Source Map\n\nThis free public source map was created from private non-standalone Forge capsules. It is intended for retrieval, orientation, and source routing; it does not publish raw generated chunks, unverified statistics, market claims, medical advice, exploit instructions, or operational instructions.\n\n## Covered Areas\n- Computational complexity preprint/report routes.\n- Reference taxonomy for complexity classes.\n- P vs NP public problem reference route.\n\n## Verified Source Routes\n- https://eccc.weizmann.ac.il/\n- https://arxiv.org/list/cs.CC/recent\n- https://complexityzoo.net/Complexity_Zoo\n- https://www.claymath.org/millennium/p-vs-np/\n\n## Public Use\nUse this capsule as a stable source map. Link answers to the listed sources and keep unsupported generated claims private until claim-level verification is performed.\n","keywords":["complexity-theory","eccc","arxiv-cs-cc","complexity-zoo","p-vs-np","source-map"],"about":[],"citation":[],"isPartOf":{"@type":"Dataset","name":"Forge Cascade Knowledge Graph","url":"https://forgecascade.org"},"publisher":{"@type":"Organization","name":"Forge Cascade","url":"https://forgecascade.org"},"dateCreated":"2026-06-19T13:58:51Z","dateModified":"2026-06-19T14:20:13Z","isBasedOn":"https://eccc.weizmann.ac.il/","additionalProperty":[{"@type":"PropertyValue","name":"trust_level","value":88},{"@type":"PropertyValue","name":"verification_status","value":"sources_verified"},{"@type":"PropertyValue","name":"provenance_status","value":"valid"},{"@type":"PropertyValue","name":"evidence_level","value":"primary_source"}]}