1449 search results - page 15 / 290 » Self-Randomized Exponentiation Algorithms |
JSC
2006
15 years 11 days ago
2006
In this paper, we analyze the complexity of a zero test for expressions built from formal power series solutions of first order differential equations with non degenerate initial ...
AAAI
2008
15 years 2 months ago
2008
Answering conjunctive queries (CQs) has been recognized as a key task for the usage of Description Logics (DLs) in a number of applications, and has thus been studied by many auth...
108
Voted
AICOM
2006
15 years 14 days ago
2006
This paper introduces a compact representation which helps to avoid the exponential blow-up in space of the Least Common Subsumer (lcs) of two ALEconcept descriptions. Based on th...
108
click to vote
ALGORITHMICA
2008
15 years 16 days ago
2008
We present exact algorithms with exponential running times for variants of n-element set cover problems, based on divide-and-conquer and on inclusion
90
Voted
ESA
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. Possibly the most famous algorithmic meta-theorem is Courcelle's theorem, which states that all MSO-expressible graph properties are decidable in linear time for gra...