Search versus Decision for $\mathsf{S}_2^\mathsf{P}$

Documents similaires

• On Condensation of Block Sensitivity, Certificate Complexity and the $\mathsf{AND}$ (and $\mathsf{OR}$) Decision Tree Complexity
  par: Nalli, Sai Soumya, et autres
  Publié: (2026)
• Total Search Problems in $\mathsf{ZPP}$
  par: Fleming, Noah, et autres
  Publié: (2025)
• $\mathsf{QAC}^0$ Contains $\mathsf{TC}^0$ (with Many Copies of the Input)
  par: Grier, Daniel, et autres
  Publié: (2026)
• Total Variation Distance for Product Distributions is $\#\mathsf{P}$-Complete
  par: Bhattacharyya, Arnab, et autres
  Publié: (2024)
• Complexity of Quadratic Bosonic Hamiltonian Simulation: $\mathsf{BQP}$-Completeness and $\mathsf{PostBQP}$-Hardness
  par: Zschetzsche, Lilith, et autres
  Publié: (2026)