25 search results - page 2 / 5 » The Closure of Monadic NP |
ACS
2010
13 years 5 months ago
2010
For a quantale V, first a closure-theoretic approach to completeness and separation in V-categories is presented. This approach is then generalized to T-categories, where T is a to...
ENTCS
2006
13 years 5 months ago
2006
Model theoretic syntax is concerned with studying the descriptive complexity of grammar formalisms for natural languages by defining their derivation trees in suitable logical for...
ECCC
2006
13 years 5 months ago
2006
Attempts at classifying computational problems as polynomial time solvable, NP-complete, or belonging to a higher level in the polynomial hierarchy, face the difficulty of undecid...
PODS
2008
ACM
14 years 5 months ago
2008
ACM
We consider the navigational core of XPath, extended with two operators: the Kleene star for taking the transitive closure of path expressions, and a subtree relativisation operat...
COCOON
2009
Springer
13 years 6 months ago
2009
Springer
We investigate the question whether NE can be separated from the reduction closures of tally sets, sparse sets and NP. We show that (1) NE RNP no(1)-T (TALLY); (2)NE RSN m (SPARS...