1092 search results - page 79 / 219 » Polynomial Interpretations and the Complexity of Algorithms |
159
click to vote
COCO
2010
Springer
15 years 10 months ago
2010
Springer
Abstract—We consider two natural extensions of the communication complexity model that are inspired by distributed computing. In both models, two parties are equipped with synchr...
174
click to vote
CIE
2007
Springer
16 years 4 days 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...
177
click to vote
ICALP
2004
Springer
15 years 11 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...
198
click to vote
STOC
2000
ACM
15 years 9 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...
169
click to vote
SAS
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. Proving the termination of a flowchart program can be done by exhibiting a ranking function, i.e., a function from the program states to a wellfounded set, which strictl...