1537 search results - page 225 / 308 » On sets not belonging to algebras |
TAMC
2007
Springer
14 years 3 months ago
2007
Springer
For generalized Reed-Solomon codes, it has been proved [7] that the problem of determining if a received word is a deep hole is coNP-complete. The reduction relies on the fact that...
ASIACRYPT
2000
Springer
14 years 1 months ago
2000
Springer
Abstract. A t out of n threshold scheme is such that shares are distributed to n participants so that any set of t participants can compute the secret, whereas any set of less than...
LCPC
1993
Springer
14 years 1 months ago
1993
Springer
This paper presents a model for concurrent programming, where programs (concurrent program structures) are represented as composition expressions over component programs with suita...
CP
2006
Springer
14 years 21 days ago
2006
Springer
We study a family of problems, called Maximum Solution, where the objective is to maximise a linear goal function over the feasible integer assignments to a set of variables subjec...
ICS
2010
Tsinghua U.
13 years 11 months ago
2010
Tsinghua U.
Autotuning technology has emerged recently as a systematic process for evaluating alternative implementations of a computation, in order to select the best-performing solution for...