9842 search results - page 115 / 1969 » Problem complexity |
COSIT
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. The Double Cross calculus has been proposed for the purpose of navigation based on qualitative information about spatial configurations. Up until now, however, no result...
AIML
2004
14 years 11 months ago
2004
This paper shows that satisfiability for Propositional Dynamic Logic with Intersection is EXPSPACE-hard. The proof uses a reduction from the word problem for alternating, exponent...
ERSHOV
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. We consider the problem of query containment for conjunctive queries with safe negation property. A necessary and sufficient condition for two queries to be in containmen...
FSTTCS
1992
Springer
15 years 2 months ago
1992
Springer
Levin introduced an average-case complexity measure, based on a notion of \polynomialon average," and de ned \average-case polynomial-time many-one reducibility" amongra...
122
click to vote
LION
2010
Springer
15 years 2 months ago
2010
Springer
This paper presents a column generation heuristic for the general vehicle routing problem (GVRP), a combined load acceptance and rich vehicle routing problem incorporating various ...