Comparing the hardness of MAX 2-SAT problem instances for quantum and classical algorithms [dataset]
收藏DataCite Commons2023-05-26 更新2024-07-13 收录
下载链接：
http://collections.durham.ac.uk/files/r2x346d419f
下载链接
链接失效反馈官方服务：
资源简介：
This archive contains two datasets. The first dataset was produced by the authors of https://arxiv.org/abs/2206.06876. The abstract here is the abstract of that paper. The second dataset was produced by the authors of https://arxiv.org/abs/1401.7320 and is being shared with their permission.
提供机构：
Durham University
创建时间：
2023-05-26
