Document Open Access Logo

The Planted Orthogonal Vectors Problem

Authors David Kühnemann , Adam Polak , Alon Rosen

PDF

File

Thumbnail PDF
PDF
LIPIcs.ESA.2025.95.pdf
  • Filesize: 0.84 MB
  • 17 pages

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Theory of computation → Computational complexity and cryptography
Keywords
  • Average-case complexity
  • fine-grained complexity
  • orthogonal vectors

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

In the k-Orthogonal Vectors (k-OV) problem we are given k sets, each containing n binary vectors of dimension d = n^o(1), and our goal is to pick one vector from each set so that at each coordinate at least one vector has a zero. It is a central problem in fine-grained complexity, conjectured to require n^{k-o(1)} time in the worst case.
We propose a way to plant a solution among vectors with i.i.d. p-biased entries, for appropriately chosen p, so that the planted solution is the unique one. Our conjecture is that the resulting k-OV instances still require time n^{k-o(1)} to solve, on average.
Our planted distribution has the property that any subset of strictly less than k vectors has the same marginal distribution as in the model distribution, consisting of i.i.d. p-biased random vectors. We use this property to give average-case search-to-decision reductions for k-OV.

Cite As Get BibTex

David Kühnemann, Adam Polak, and Alon Rosen. The Planted Orthogonal Vectors Problem. In 33rd Annual European Symposium on Algorithms (ESA 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 351, pp. 95:1-95:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LIPIcs.ESA.2025.95

Author Details

David Kühnemann
  • University of Amsterdam, The Netherlands
Adam Polak
  • Bocconi University, Milan, Italy
Alon Rosen
  • Bocconi University, Milan, Italy

Funding

Work supported by European Research Council (ERC) under the EU’s Horizon 2020 research and innovation programme (Grant agreement No. 101019547) and Cariplo CRYPTONOMEX grant. Part of this work was done when the first author was visiting Bocconi University.

Acknowledgements

We are grateful to Andrej Bogdanov, Antoine Joux, Moni Naor, Nicolas Resch, Nikolaj Schwartzbach, and Prashant Vasudevan for insightful discussions.

References

  1. Amir Abboud, Richard Ryan Williams, and Huacheng Yu. More applications of the polynomial method to algorithm design. In Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, pages 218-230. SIAM, 2015. URL: https://doi.org/10.1137/1.9781611973730.17.
  2. Shweta Agrawal, Sagnik Saha, Nikolaj I. Schwartzbach, Akhil Vanukuri, and Prashant Nalini Vasudevan. k-SUM in the sparse regime: Complexity and applications. In Advances in Cryptology - CRYPTO 2024 - 44th Annual International Cryptology Conference, volume 14921 of Lecture Notes in Computer Science, pages 315-351. Springer, 2024. URL: https://doi.org/10.1007/978-3-031-68379-4_10.
  3. Josh Alman. An illuminating algorithm for the light bulb problem. In 2nd Symposium on Simplicity in Algorithms, SOSA 2019, volume 69 of OASIcs, pages 2:1-2:11. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. URL: https://doi.org/10.4230/OASICS.SOSA.2019.2.
  4. Josh Alman, Alexandr Andoni, and Hengjie Zhang. Faster algorithms for average-case orthogonal vectors and closest pair problems. In 2025 Symposium on Simplicity in Algorithms (SOSA), pages 473-484. SIAM, 2025. URL: https://doi.org/10.1137/1.9781611978315.35.
  5. Josh Alman, Yizhi Huang, and Kevin Yeo. Fine-grained complexity in a world without cryptography. In Advances in Cryptology - EUROCRYPT 2025 - 44th Annual International Conference on the Theory and Applications of Cryptographic Techniques, volume 15607 of Lecture Notes in Computer Science, pages 375-405. Springer, 2025. URL: https://doi.org/10.1007/978-3-031-91098-2_14.
  6. Marshall Ball, Alon Rosen, Manuel Sabin, and Prashant Nalini Vasudevan. Average-case fine-grained hardness. In Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017, pages 483-496. ACM, 2017. URL: https://doi.org/10.1145/3055399.3055466.
  7. Enric Boix-Adserà, Matthew S. Brennan, and Guy Bresler. The average-case complexity of counting cliques in Erdős-Rényi hypergraphs. In 60th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2019, pages 1256-1280. IEEE Computer Society, 2019. URL: https://doi.org/10.1109/FOCS.2019.00078.
  8. Timothy M. Chan and R. Ryan Williams. Deterministic APSP, orthogonal vectors, and more: Quickly derandomizing Razborov-Smolensky. ACM Trans. Algorithms, 17(1):2:1-2:14, 2021. Announced at SODA 2016. URL: https://doi.org/10.1145/3402926.
  9. Lijie Chen and Ryan Williams. An equivalence class for orthogonal vectors. In Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019, pages 21-40. SIAM, 2019. URL: https://doi.org/10.1137/1.9781611975482.2.
  10. Mina Dalirrooyfard, Andrea Lincoln, Barna Saha, and Virginia Vassilevska Williams. Average-case hardness of parity problems: Orthogonal vectors, k-SUM and more. In Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2025, pages 4613-4643. SIAM, 2025. URL: https://doi.org/10.1137/1.9781611978322.158.
  11. Mina Dalirrooyfard, Andrea Lincoln, and Virginia Vassilevska Williams. New techniques for proving fine-grained average-case hardness. In 61st IEEE Annual Symposium on Foundations of Computer Science, FOCS 2020, pages 774-785. IEEE, 2020. URL: https://doi.org/10.1109/FOCS46700.2020.00077.
  12. Itai Dinur, Nathan Keller, and Ohad Klein. Fine-grained cryptanalysis: Tight conditional bounds for dense k-SUM and k-XOR. J. ACM, 71(3):23, 2024. Announced at FOCS 2021. URL: https://doi.org/10.1145/3653014.
  13. Jiawei Gao, Russell Impagliazzo, Antonina Kolokolova, and Ryan Williams. Completeness for first-order properties on sparse structures with algorithmic applications. ACM Trans. Algorithms, 15(2):23:1-23:35, 2019. Announced at SODA 2017. URL: https://doi.org/10.1145/3196275.
  14. Oded Goldreich and Guy N. Rothblum. Counting t-cliques: Worst-case to average-case reductions and direct interactive proof systems. In 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, pages 77-88. IEEE Computer Society, 2018. URL: https://doi.org/10.1109/FOCS.2018.00017.
  15. Shuichi Hirahara and Nobutaka Shimizu. Hardness self-amplification: Simplified, optimized, and unified. In Proceedings of the 55th Annual ACM Symposium on Theory of Computing, STOC 2023, pages 70-83. ACM, 2023. URL: https://doi.org/10.1145/3564246.3585189.
  16. Russell Impagliazzo, Ramamohan Paturi, and Francis Zane. Which problems have strongly exponential complexity? J. Comput. Syst. Sci., 63(4):512-530, 2001. Announced at FOCS 1998. URL: https://doi.org/10.1006/JCSS.2001.1774.
  17. Russell Impagliazzo and Steven Rudich. Limits on the provable consequences of one-way permutations. In Proceedings of the 21st Annual ACM Symposium on Theory of Computing, pages 44-61. ACM, 1989. URL: https://doi.org/10.1145/73007.73012.
  18. Ari Juels and Marcus Peinado. Hiding cliques for cryptographic security. Designs, Codes and Cryptography, 20(3):269-280, 2000. Announced at SODA 1998. Google Scholar
  19. Daniel M. Kane and Richard Ryan Williams. The orthogonal vectors conjecture for branching programs and formulas. In 10th Innovations in Theoretical Computer Science Conference, ITCS 2019, volume 124 of LIPIcs, pages 48:1-48:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. URL: https://doi.org/10.4230/LIPICS.ITCS.2019.48.
  20. Matti Karppa, Petteri Kaski, and Jukka Kohonen. A faster subquadratic algorithm for finding outlier correlations. ACM Trans. Algorithms, 14(3):31:1-31:26, 2018. Announced at SODA 2016. URL: https://doi.org/10.1145/3174804.
  21. Matti Karppa, Petteri Kaski, Jukka Kohonen, and Padraig Ó Catháin. Explicit correlation amplifiers for finding outlier correlations in deterministic subquadratic time. Algorithmica, 82(11):3306-3337, 2020. Announced at ESA 2016. URL: https://doi.org/10.1007/S00453-020-00727-1.
  22. Karthik C. S. and Pasin Manurangsi. On closest pair in euclidean metric: Monochromatic is as hard as bichromatic. In 10th Innovations in Theoretical Computer Science Conference, ITCS 2019, volume 124 of LIPIcs, pages 17:1-17:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. URL: https://doi.org/10.4230/LIPICS.ITCS.2019.17.
  23. Rio LaVigne, Andrea Lincoln, and Virginia Vassilevska Williams. Public-key cryptography in the fine-grained setting. In Advances in Cryptology - CRYPTO 2019 - 39th Annual International Cryptology Conference, volume 11694 of Lecture Notes in Computer Science, pages 605-635. Springer, 2019. URL: https://doi.org/10.1007/978-3-030-26954-8_20.
  24. Ralph C. Merkle. Secure communications over insecure channels. Commun. ACM, 21(4):294-299, 1978. URL: https://doi.org/10.1145/359460.359473.
  25. Alon Rosen. Fine-grained cryptography: A new frontier? IACR Cryptol. ePrint Arch., page 442, 2020. URL: https://eprint.iacr.org/2020/442.
  26. Gregory Valiant. Finding correlations in subquadratic time, with applications to learning parities and the closest pair problem. J. ACM, 62(2):13:1-13:45, 2015. Announced at FOCS 2012. URL: https://doi.org/10.1145/2728167.
  27. Virginia Vassilevska Williams. On some fine-grained questions in algorithms and complexity, pages 3447-3487. World Scientific, 2018. URL: https://doi.org/10.1142/9789813272880_0188.
  28. R. Ryan Williams. Some estimated likelihoods for computational complexity. In Computing and Software Science - State of the Art and Perspectives, volume 10000 of Lecture Notes in Computer Science, pages 9-26. Springer, 2019. URL: https://doi.org/10.1007/978-3-319-91908-9_2.
  29. Ryan Williams. A new algorithm for optimal 2-constraint satisfaction and its implications. Theor. Comput. Sci., 348(2-3):357-365, 2005. URL: https://doi.org/10.1016/J.TCS.2005.09.023.
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact