844 search results - page 44 / 169 » Solving the p |
SSWMC
2004
14 years 11 months ago
2004
We analyze the complexity of the steganography problem and show that the decision version of the problem is NP-complete through transformation from the Knapsack problem. We also g...
AAAI
1993
14 years 11 months ago
1993
Recently several local hill-climbing procedures for propositional satisability have been proposed, which are able to solve large and di cult problems beyond the reach of conventio...
EJC
2010
14 years 9 months ago
2010
We invesitage the multiplicative loops of finite semifields. We show that the group generated by the left and right multiplication maps contains the special linear group. This resu...
ACG
2006
Springer
15 years 3 months ago
2006
Springer
First, this paper introduces a new family of k-in-a-row games, Connect(m, n, k, p, q). In Connect(m, n, k, p, q), two players alternately place p stones on an m × n board in each ...
CPM
2000
Springer
15 years 2 months ago
2000
Springer
We study Hamming versions of two classical clustering problems. The Hamming radius p-clustering problem (HRC) for a set S of k binary strings, each of length n, is to find p bina...