25 search results - page 1 / 5 » The Closure of Monadic NP |
JCSS
2000
13 years 5 months ago
2000
It is a well-known result of Fagin that the complexity class NP coincides with the class of problems expressible in existential second-order logic ( 1 1), which allows sentences c...
CIE
2007
Springer
13 years 11 months ago
2007
Springer
We expose a strict hierarchy within monotone monadic strict NP without inequalities (MMSNP), based on the number of second-order monadic quantifiers. We do this by studying a fin...
LCC
1994
13 years 9 months ago
1994
The descriptive complexity of a problem is the complexity of describing the problem in some logical formalism. One of the few techniques for proving separation results in descripti...
STACS
2001
Springer
13 years 9 months ago
2001
Springer
In 1974 R. Fagin proved that properties of structures which are in NP are exactly the same as those expressible by existential second order sentences, that is sentences of the form...
APAL
2004
13 years 5 months ago
2004
The model-checking problem for a logic L on a class C of structures asks whether a given L-sentence holds in a given structure in C. In this paper, we give super-exponential lower...