Recognizing Pseudo-intents is coNP-complete.
Mikhail A. Babin, Sergei O. Kuznetsov · 2010
Abstract. The problem of recognizing whether a subset of attributes is a pseudo-intent is shown to be coNP-hard, which together with the previous results means that this problem is coNP-complete. Recognizing an essential intent is shown to be NP-complete and recognizing the lectically largest pseudo-intent is shown to be coNP-hard. 1