Mande, N. S., & Shao, C. (2024). Lower bounds for quantum-inspired classical algorithms via communication complexity.
Style de citation Chicago (17e éd.)Mande, Nikhil S., et Changpeng Shao. Lower Bounds for Quantum-inspired Classical Algorithms via Communication Complexity. 2024.
Style de citation MLA (9e éd.)Mande, Nikhil S., et Changpeng Shao. Lower Bounds for Quantum-inspired Classical Algorithms via Communication Complexity. 2024.
Attention : ces citations peuvent ne pas être correctes à 100%.