PPP-Completeness with Connections to Cryptography¶
Sotiraki, K., Zampetakis, M., & Zirdelis, G. (2018). PPP-Completeness with Connections to Cryptography. 2018 IEEE 59th Annual Symposium on Foundations of Computer Science, 148-158.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Domain-specific¶
- PPP (complexity)
- Membership is about this witness-preserving reduction, not simply about having a counting argument for existence.
This sourceFull official proceedings article inspected; it states the result and gives proof overviews. The authors' full original preprint v1, §§2.1 and 4, supplies the detailed Karp reductions and Lemmas 4.4–4.5 under the paper's cSIS parameter conditions.
- Membership is about this witness-preserving reduction, not simply about having a counting argument for existence.
Verification¶
Does it exist? Not checked yet. This work's DOI is recorded above but has not been resolved against an external catalogue, so nothing here confirms the work exists.
Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Registry ID ref:0f8f65b2a84b · see in the full table