BriefGPT.xyz
Apr, 2011
二元量化约束满足问题的混合可计算类
Hybrid Tractable Classes of Binary Quantified Constraint Satisfaction Problems
HTML
PDF
Jian Gao, Minghao Yin, Junping Zhou
TL;DR
本文研究二元量化约束满足问题的混合可处理性，利用破坏三角形性质识别了一类基本的可处理问题，通过引入破坏角度约束，打破了变量排序的限制，进一步识别出一些新的可处理问题，并最终确定了更广泛的可处理类型，即QCSP的min-of-max可扩展类。
Abstract
In this paper, we investigate the hybrid
tractability
of binary
quantified constraint satisfaction problems
(QCSPs). First, a basic tractable class of binary QCSPs is identified by using the
→