ROBUSTLY SOLVABLE CONSTRAINT SATISFACTION PROBLEMS

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F16%3A10331373" target="_blank" >RIV/00216208:11320/16:10331373 - isvavai.cz</a>

Result on the web

<a href="http://dx.doi.org/10.1137/130915479" target="_blank" >http://dx.doi.org/10.1137/130915479</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1137/130915479" target="_blank" >10.1137/130915479</a>

Result language

angličtina

Original language name

ROBUSTLY SOLVABLE CONSTRAINT SATISFACTION PROBLEMS

Original language description

An algorithm for a constraint satisfaction problem is called robust if it outputs an assignment satisfying at least (1-g(epsilon))-fraction of the constraints given a (1 - epsilon)-satisfiable instance, where g(epsilon) -> 0 as epsilon -> 0. Guruswami and Zhou conjectured a characterization of constraint languages for which the corresponding constraint satisfaction problem admits an efficient robust algorithm. This paper confirms their conjecture.

Czech name

—

Czech description

—

Type

J_x - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

CEP classification

BA - General mathematics

OECD FORD branch

—

Project

<a href="/en/project/GA13-01832S" target="_blank" >GA13-01832S: General algebra and its connections to computer science</a><br>

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year

2016

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

SIAM Journal on Computing

ISSN

0097-5397

e-ISSN

—

Volume of the periodical

45

Issue of the periodical within the volume

4

Country of publishing house

US - UNITED STATES

Number of pages

24

Pages from-to

1646-1669

UT code for WoS article

000385001200016

EID of the result in the Scopus database

2-s2.0-84990966353