1 citations · 1 across the 2 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2021
Combinatorial Gap Theorem and Reductions between Promise CSPs
Libor Barto, Marcin Kozik
A value of a CSP instance is typically defined as a fraction of constraints that can be simultaneously met. We propose an alternative definition of a value of an instance and show…
cs.CC2019
Dichotomy for symmetric Boolean PCSPs
Miron Ficak, Marcin Kozik, Miroslav Olsak +1
A PCSP is a combination of two CSPs defined by two similar templates; the computational question is to distinguish a YES instance of the first one from a NO instance of the second.…