activity
20132023
most citedWhen the Optimum is also Blind: a New Perspective on Universal Optimization

4 citations · 6 across the 7 of their papers we have counts for

collaborators
Showing 2020 · cs.CCShow all

1 paper · 2 filters

cs.CC2020

Optimal polynomial-time compression for Boolean Max CSP

Bart M. P. Jansen, Michał Włodarczyk

In the Boolean maximum constraint satisfaction problem - Max CSP - one is given a collection of weighted applications of constraints from a finite constraint language , ove…