9842 search results - page 34 / 1969 » The Complexity of the Matching-Cut Problem |
FOCS
1994
IEEE
13 years 11 months ago
1994
IEEE
This paper concerns the open problem of Lov
BCS
2008
13 years 9 months ago
2008
Parity games underlie the model checking problem for the modal
LFCS
1997
Springer
13 years 11 months ago
1997
Springer
The provability problem for the Horn fragment of linear logic is NP-complete [4, 1]. In this work we investigate various definitions of concurrency proposed in [2] and establish t...
APAL
2004
13 years 7 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...
LATA
2012
Springer
12 years 3 months ago
2012
Springer
We investigate the application of Courcelle’s Theorem and the logspace version of Elberfeld et al. in the context of the implication problem for propositional sets of formulae, t...