1650 search results - page 144 / 330 » The HOM problem is decidable |
114
click to vote
COCOA
2007
Springer
15 years 10 months ago
2007
Springer
This paper attends to the problem of a mechanism designer seeking to influence the outcome of a strategic game based on her creditability. The mechanism designer offers additional...
151
click to vote
FAW
2007
Springer
15 years 10 months ago
2007
Springer
In this paper, we consider the recognition problem on a class of perfectly orderable graphs, namely, the HHD-free graphs, i.e., graphs that do not contain any induced subgraph iso...
148
click to vote
FCT
2007
Springer
15 years 10 months ago
2007
Springer
We present quantum query complexity bounds for testing algebraic properties. For a set S and a binary operation on S, we consider the decision problem whether S is a semigroup or ...
113
click to vote
IWSEC
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. With the digitization of society and the continuous migration of services to the electronic world, individuals have lost significant control over their data. In this pap...
121
click to vote
LPNMR
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Most complete answer set solvers are based on DPLL. One of the constraint propagation methods is the so-called lookahead, which has been somewhat controversial, due to it...