Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > AUTHORS > BJÖRN MARTINSSON:
All reports by Author Björn Martinsson:

TR25-082 | 23rd June 2025
Per Austrin, Johan Håstad, Björn Martinsson

On the usefulness of Promises

A Boolean predicate $A$ is defined to be promise-useful if $PCSP(A,B)$ is tractable for some non-trivial $B$ and otherwise it is promise-useless. We initiate investigations of this notion and derive sufficient conditions for both promise-usefulness and promise-uselessness (assuming $\text{P} \ne \text{NP}$). While we do not obtain a complete characterization, our ... more >>>




ISSN 1433-8092 | Imprint