Robust Satisfiability of Constraint Satisfaction Problems
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F12%3A10127453" target="_blank" >RIV/00216208:11320/12:10127453 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Robust Satisfiability of 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(?)-fraction of the constraints given a (1 - ?)-satisfiable instance, where g(?) RIGHTWARDS ARROW 0 as ? RIGHTWARDS ARROW 0, g(0) = 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
—
Classification
Type
D - Article in proceedings
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2012
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Proceedings of the 44th symposium on Theory of Computing
ISBN
978-1-4503-1245-5
ISSN
—
e-ISSN
—
Number of pages
10
Pages from-to
931-940
Publisher name
Association for Computing Madinery
Place of publication
New York, NY, USA
Event location
New York
Event date
May 19, 2012
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—