论文信息 - Comparing the hardness of MAX 2-SAT problem instances for quantum and classical algorithms - 字舞流文

Comparing the hardness of MAX 2-SAT problem instances for quantum and classical algorithms

V. Kendon | Nicholas Chancellor | A. Callison | Puya Mirkarimi | Lewis Light | N. Chancellor