Conditional Dichotomy of Boolean Ordered Promise CSPs

Promise Constraint Satisfaction Problems (PCSPs) are a generalization of Constraint Satisfaction Problems (CSPs) where each predicate has a strong and a weak form and given a CSP instance, the objective is to distinguish if the strong form can be satisfied vs. even the weak form cannot be satisfied....

Celý popis

Podrobná bibliografia

Vydané v:	arXiv.org
Hlavní autori:	Brakensiek, Joshua, Venkatesan Guruswami, Sai Sandeep
Médium:	Paper
Jazyk:	English
Vydavateľské údaje:	Ithaca Cornell University Library, arXiv.org 23.01.2023
Predmet:	Boolean Boolean algebra Monotone functions Polynomials
ISSN:	2331-8422
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!