On the Complexity of the Parity Argument and Other Inefficient Proofs of Existence¶
Papadimitriou, C. H. (1994). On the Complexity of the Parity Argument and Other Inefficient Proofs of Existence. Journal of Computer and System Sciences, 498-532.
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 original-paper reprint inspected; the Equal Sums and algorithm remarks are time-indexed.
- Membership is about this witness-preserving reduction, not simply about having a counting argument for existence.
Verification¶
Does it exist? Not checked yet. This entry carries no identifier to resolve. It was extracted from the citation as written in the article, normalized, and deduplicated against the rest of the registry.
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:65bdeb0fbe0e · see in the full table