ConceptioArchiveStack Exchange
Stack Exchangeopen access

Problems that can be used to show polynomial-time hardness results

Robin Kothari · 2010
Stack Exchange · Datasets · License: CC BY-SA · 2010
Open Source ↗
ccsa
cc.complexity theory, lower bounds, conditional results, cstheory, cc-by-sa-2.5
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 787541
Retrieved via Conceptio — every document is proof-bundled with source, license, and retrieval metadata.