165 search results - page 32 / 33 » Improved Lower Bounds on the Randomized Complexity of Graph ... |
STOC
2010
ACM
13 years 9 months ago
2010
ACM
Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computa...
STOC
2004
ACM
14 years 5 months ago
2004
ACM
The complexity of testing properties of monotone and unimodal distributions, when given access only to samples of the distribution, is investigated. Two kinds of sublineartime alg...
SODA
2010
ACM
14 years 2 months ago
2010
ACM
We study the computational complexity of some central analysis problems for One-Counter Markov Decision Processes (OC-MDPs), a class of finitely-presented, countable-state MDPs. O...
CRYPTO
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. We consider the central cryptographic task of secure twoparty computation, where two parties wish to compute some function of their private inputs (each receiving possibl...
CORR
2011
Springer
13 years 8 days ago
2011
Springer
Valiant’s (2007) model of evolvability models the evolutionary process of acquiring useful functionality as a restricted form of learning from random examples. Linear threshold ...