4378 search results - page 267 / 876 » On the Complexity of Ordered Colourings |
147
click to vote
PODS
1991
ACM
15 years 10 months ago
1991
ACM
In this paper we characterise exactly the complexity of a set based database language called SRL, which presents a unified framework for queries and updates. By imposing simple s...
199
click to vote
CIAC
2010
Springer
15 years 10 months ago
2010
Springer
We investigate the relationship between two kinds of vertex colorings of graphs: uniquemaximum colorings and conflict-free colorings. In a unique-maximum coloring, the colors are ...
143
click to vote
AAAI
2007
15 years 9 months ago
2007
Performing experiments with human-robot interfaces often requires the allocation of expensive and complex hardware and large physical spaces. Those costs constrain development and...
165
click to vote
AAAI
2007
15 years 9 months ago
2007
Ontology mapping is a complex and necessary task for many Semantic Web (SW) applications. The perspective users are faced with a number of challenges including the difficulties o...
183
click to vote
ANTS
2008
Springer
15 years 8 months ago
2008
Springer
We present and analyze two algorithms for computing the Hilbert class polynomial HD. The first is a p-adic lifting algorithm for inert primes p in the order of discriminant D < ...