Stack Exchangeopen access
Are runtime bounds in P decidable? (answer: no)
cc.complexity theory, approximation hardness, cstheory, cc-by-sa-4.0
This document is indexed with metadata only — full text is not available in the archive for this record.
Open the official source ↗Related documents
Record · ID 787525
Retrieved via
Conceptio — every document is proof-bundled with source, license, and retrieval metadata.