9842 search results - page 223 / 1969 » Problem complexity |
142
Voted
SIAMDM
2008
15 years 2 months ago
2008
We introduce two variants of proper colorings with imposed partial ordering on the set of colors. One variant shows very close connections to some fundamental problems in graph the...
123
Voted
SIAMSC
2008
15 years 1 months ago
2008
In the mathematical modeling of real-life applications, systems of equations with complex coefficients often arise. While many techniques of numerical linear algebra, e.g., Krylovs...
119
Voted
JAPLL
2010
15 years 1 months ago
2010
We introduce the extended modal logic EML with regularity constraints and full Presburger constraints on the number of children that generalize graded modalities, also known as nu...
103
click to vote
WIOPT
2010
IEEE
15 years 29 days ago
2010
IEEE
—K-shell (or k-core) graph decomposition methods were introduced as a tool for studying the structure of large graphs. K-shell decomposition methods have been recently proposed [...
122
Voted
ECAI
2010
Springer
15 years 19 days ago
2010
Springer
We investigate the complexity of axiom pinpointing for different members of the DL-Lite family of Description Logics. More precisely, we consider the problem of enumerating all mi...