4378 search results - page 336 / 876 » On the Complexity of Ordered Colourings |
186
click to vote
SIGCSE
2009
ACM
16 years 7 months ago
2009
ACM
This paper describes a new tool for introducing computer graphics and multimedia applications into first year, called QuickDraw, and our experience using it. QuickDraw provides an...
173
click to vote
CAV
2009
Springer
16 years 7 months ago
2009
Springer
Abstract. When a model does not satisfy a given specification, a counterexample is produced by the model checker to demonstrate the failure. A user must then examine the counterexa...
228
click to vote
CAV
2009
Springer
16 years 7 months ago
2009
Springer
Context-bounded analysis is an attractive approach to verification of concurrent programs. Bounding the number of contexts executed per thread not only reduces the asymptotic compl...
194
click to vote
STOC
2006
ACM
16 years 7 months ago
2006
ACM
Unique games are constraint satisfaction problems that can be viewed as a generalization of Max-Cut to a larger domain size. The Unique Games Conjecture states that it is hard to ...
257
click to vote
SIGMOD
2009
ACM
16 years 7 months ago
2009
ACM
Database outsourcing requires that a query server constructs a proof of result correctness, which can be verified by the client using the data owner's signature. Previous aut...