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....

Full description

Bibliographic Details

Published in:	arXiv.org
Main Authors:	Brakensiek, Joshua, Venkatesan Guruswami, Sai Sandeep
Format:	Paper
Language:	English
Published:	Ithaca Cornell University Library, arXiv.org 23.01.2023
Subjects:	Boolean Boolean algebra Monotone functions Polynomials
ISSN:	2331-8422
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!