OutputP Membership of Minimal Hypergraph Transversal Enumeration
Determine whether enumerating the minimal transversals of a hypergraph belongs to OutputP.
References
In contrast, it showed that enumerating the prime implicant explanations of an arbitrary model of an $\mathtt{OBDD}$ ($\mathtt{Enum_{srs}[OBDD]}$) is at least as hard as enumerating the minimal transversals of a hypergraph, an enumeration problem whose membership to OutputP is a longstanding open question in complexity theory.
— Solving Hard XAI Queries Based on a Compiled Dual-Rail Encoding
(2609.04931 - Ledaguenel et al., 4 Sep 2026) in Section 4, paragraph “Enumeration”
The principal open question would be whether the qualitative conclusion can be obtained under a weaker assumption, such as $\mathrm{P} \neq \mathrm{NP}$.
— An ETH-based quasipolynomial lower bound for Dualization
(2610.11473 - Kobayashi et al., 8 Oct 2026) in Section Discussion
Whether the minimal transversals can be enumerated in output-polynomial time is a long-standing open question .
— Trust a Few: The Weakest Assumptions a Protocol Needs
(2610.09730 - Mittal et al., 7 Oct 2026) in Theorem 6.1, Section 6.5 “Cost” (Section \ref{sec:cost})