4403 search results - page 775 / 881 » Galois Theory of Algorithms |
195
click to vote
STOC
2006
ACM
16 years 7 months ago
2006
ACM
In this paper we consider bounded real-valued functions over the discrete cube, f : {-1, 1}n [-1, 1]. Such functions arise naturally in theoretical computer science, combinatorics...
177
click to vote
STOC
2006
ACM
16 years 7 months ago
2006
ACM
We consider the problem of randomness extraction from independent sources. We construct an extractor that can extract from a constant number of independent sources of length n, ea...
216
click to vote
STOC
2005
ACM
16 years 7 months ago
2005
ACM
This paper explores what kinds of information two parties must communicate in order to correct errors which occur in a shared secret string W. Any bits they communicate must leak ...
175
click to vote
STOC
2002
ACM
16 years 7 months ago
2002
ACM
We investigate the price of selfish routing in non-cooperative networks in terms of the coordination and bicriteria ratios in the recently introduced game theoretic network model ...
304
click to vote
SIGMOD
2009
ACM
16 years 7 months ago
2009
ACM
Conditional functional dependencies (CFDs) have recently been proposed as extensions of classical functional dependencies that apply to a certain subset of the relation, as specif...