467 search results - page 52 / 94 » The Complexity of Polynomials and Their Coefficient Function... |
100
click to vote
ATAL
2009
Springer
15 years 6 months ago
2009
Springer
Coalition formation is a key topic in multi–agent systems (mas). Coalitions enable agents to achieve goals that they may not have been able to achieve independently, and encoura...
111
click to vote
CIE
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. The input to a constraint satisfaction problem (CSP) consists of a set of variables, each with a domain, and constraints between these variables formulated by relations o...
110
click to vote
ICALP
2004
Springer
15 years 5 months ago
2004
Springer
We define a natural notion of efficiency for approximate nearest-neighbor (ANN) search in general n-point metric spaces, namely the existence of a randomized algorithm which answ...
126
click to vote
STOC
2000
ACM
15 years 3 months ago
2000
ACM
We first study the problem of doing Verifiable Secret Sharing (VSS) information theoretically secure for a general access structure. We do it in the model where private channels b...
STOC
2003
ACM
16 years 3 days ago
2003
ACM
Let H be a fixed directed graph on h vertices, let G be a directed graph on n vertices and suppose that at least n2 edges have to be deleted from it to make it H-free. We show tha...