Weizmann Logo
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style

Reports tagged with linear systems:
TR18-059 | 6th April 2018
Joshua Brakensiek, Venkatesan Guruswami

Combining LPs and Ring Equations via Structured Polymorphisms

Revisions: 1

Promise CSPs are a relaxation of constraint satisfaction problems where the goal is to find an assignment satisfying a relaxed version of the constraints. Several well known problems can be cast as promise CSPs including approximate graph and hypergraph coloring, discrepancy minimization, and interesting variants of satisfiability. Similar to CSPs, ... more >>>

ISSN 1433-8092 | Imprint