The complexity of finite-valued CSPs

<p>Let Γ be a set of rational-valued functions on a fixed finite domain; such a set is called a finite-valued constraint language. The valued constraint satisfaction problem, VCSP(Γ), is the problem of minimising a function given as a sum of functions from Γ. We establish a dichotomy theorem w...

সম্পূর্ণ বিবরণ

গ্রন্থ-পঞ্জীর বিবরন
প্রধান লেখক: Thapper, J, Živný, S
বিন্যাস: Conference item
প্রকাশিত: Association for Computing Machinery 2013