Simultaneous Max-Cut Is Harder to Approximate Than Max-Cut

Simultaneous Max-Cut Is Harder to Approximate Than Max-Cut
复制标题

同时 Max-Cut 比 Max-Cut 更难近似

DOI:
10.4230/lipics.ccc.2020.9
复制
发表时间:
2020
期刊:
35th Computational Complexity Conference (CCC 2020
影响因子:
--
通讯作者:
Khot, Subhash
Khot, Subhash
中科院分区:
--
文献类型:
--
作者:
Bhangale, Amey;Khot, Subhash

文献摘要

相似文献