4378 search results - page 179 / 876 » On the Complexity of Ordered Colourings |
199
click to vote
JAIR
2007
15 years 6 months ago
2007
This work is a contribution to prioritized reasoning in logic programming in the presence of preference relations involving atoms. The technique, providing a new interpretation fo...
134
click to vote
CORR
2002
Springer
15 years 6 months ago
2002
Springer
We study xpoints of operators on lattices. To this end we introduce the notion of an approximation of an operator. We order approximations by means of a precision ordering. We sho...
211
click to vote
FGCS
2002
15 years 6 months ago
2002
As the practice of science moves beyond the single investigator due to the complexity of the problems that now dominate science, large collaborative and multi-institutional teams ...
208
click to vote
PKC
2011
Springer
14 years 9 months ago
2011
Springer
At TCC 2005, Groth underlined the usefulness of working in small RSA subgroups of hidden order. In assessing the security of the relevant hard problems, however, the best attack co...
206
click to vote
PLDI
2012
ACM
13 years 9 months ago
2012
ACM
Existing dynamic race detectors suffer from at least one of the following three limitations: (i) space overhead per memory location grows linearly with the number of parallel thre...