The Ward-Szabó search problem is shown to be PPP-complete.
Total NP Search Problems with Abundant Solutions
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
The PPP-completeness of the Ward-Szabo theorem
The Ward-Szabó search problem is shown to be PPP-complete.