The complexity of Boolean surjective general-valued CSPs
<p>Valued constraint satisfaction problems (VCSPs) are discrete optimisation problems with a $\overline{\mathbb{Q}}$-valued objective function given as a sum of fixed-arity functions, where $\overline{\mathbb{Q}}=\mathbb{Q}\cup\{\infty\}$ is the set of extended rationals.</p> <p>In...
主要な著者: | Fulla, P, Zivny, S |
---|---|
フォーマット: | Journal article |
出版事項: |
2017
|
類似資料
-
The complexity of Boolean surjective general-valued CSPs
著者:: Fulla, P, 等
出版事項: (2017) -
The complexity of Boolean surjective general-valued CSPs
著者:: Fulla, P, 等
出版事項: (2018) -
On planar valued CSPs
著者:: Fulla, P, 等
出版事項: (2017) -
On planar valued CSPs
著者:: Fulla, P, 等
出版事項: (2016) -
Beyond boolean surjective VCSPs
著者:: Matl, G, 等
出版事項: (2019)