Citation Formats
MLA
Crosson, Elizabeth, Adam Callison, and Puya Mirkarimi. Comparing the Hardness of Max 2-sat Problem Instances for Quantum and Classical Algorithms [dataset]. Durham University, 2023.
APA
Crosson, E., Callison, A., & Mirkarimi, P. (2023). Comparing the hardness of MAX 2-SAT problem instances for quantum and classical algorithms [dataset]. Durham University.
Chicago
Crosson, Elizabeth, Adam Callison, and Puya Mirkarimi. Comparing the Hardness of MAX 2-SAT Problem Instances for Quantum and Classical Algorithms [dataset]. Durham University, 2023.