The complexity of comparing optimal solutions

Da-Ren Chen,Min-Zheng Shieh,Shi-Chun Tsai

Information Processing Letters（2022）

引用 2|浏览6

暂无评分

摘要

•A new systematic approach to prove the hardness of comparison problems.•Comparison problems of WeightedMaxSAT, WeightedClique, TSP and 01ILP are Δ2p-complete.•Comparison problems of MaxIndependentSet, MinVertexCover, LongestCycle and Coloring are Θ2p-complete.

查看译文

关键词

Computational complexity,Polynomial hierarchy,Δ2p-complete,WeightedMaxSAT,CompWeightedMaxSAT

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要