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...
| Egile Nagusiak: | , |
|---|---|
| Formatua: | Journal article |
| Argitaratua: |
2017
|
Search Result 1
Search Result 2
