Reductions in \textbf{PPP}

DOI10.1016/j.ipl.2018.12.009zbMath1446.68067OpenAlexW2909596206MaRDI QIDQ1730025

Xianqiang Yang

Publication date: 11 March 2019

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2018.12.009

zbMATH Keywords

computational complexitycombinatorial problemstheory of computation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (1)

Unnamed Item

Cites Work

• Unnamed Item
• On total functions, existence theorems and computational complexity
• Integer factoring and modular square roots
• On the complexity of the parity argument and other inefficient proofs of existence
• Number balancing is as hard as Minkowski's theorem and shortest vector
• The Complexity of Computing a Nash Equilibrium
• On the existence of extractable one-way functions
• Algorithmic Game Theory

This page was built for publication: Reductions in \textbf{PPP}