About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
STOC 1998
Conference paper
Closure of monadic NP
Abstract
Monadic NP is the class of problems expressible in monadic ∑11, i.e., ∑11 with the restriction that the second-order quantifiers are all unary, and hence range only over sets. Closed monadic NP is the closure of monadic NP under first-order quantification and existential unary second-order quantifiers. Thus, closed monadic NP differs from monadic NP in that the possibility of arbitrary interleavings of first-order quantifiers is allowed among the existential unary second-order quantifiers. Closed monadic NP is a natural, rich and robust subclass of NP. Closed monadic NP contains an undirected graph property not in the closure of monadic NP under first-order quantification and Boolean operation.