Showing 1 - 8 results of 8 for search 'Fulla, P', query time: 0.02s
Refine Results
-
1
-
2
-
3
The complexity of Boolean surjective general-valued CSPs by Fulla, P, Zivny, S
Published 2017Conference item -
4
A Galois connection for valued constraint languages of infinite size by Fulla, P, Živný, S
Published 2015Conference item -
5
The complexity of Boolean surjective general-valued CSPs by Fulla, P, Zivny, S
Published 2017Journal article -
6
-
7
A Galois connection for weighted (relational) clones of infinite size by Fulla, P, Zivny, S
Published 2015Journal article -
8
The complexity of Boolean surjective general-valued CSPs by Fulla, P, Uppman, H, Zivny, S
Published 2018Journal article