467 search results - page 86 / 94 » The Complexity of Polynomials and Their Coefficient Function... |
104
Voted
STOC
2009
ACM
16 years 8 days ago
2009
ACM
The "direct product code" of a function f gives its values on all k-tuples (f(x1), . . . , f(xk)). This basic construct underlies "hardness amplification" in c...
97
Voted
WINE
2009
Springer
15 years 6 months ago
2009
Springer
We study an economic setting in which a principal motivates a team of strategic agents to exert costly effort toward the success of a joint project. The action taken by each agent...
110
Voted
FOCS
2008
IEEE
15 years 6 months ago
2008
IEEE
Learning problems form an important category of computational tasks that generalizes many of the computations researchers apply to large real-life data sets. We ask: what concept ...
EUROCRYPT
2003
Springer
15 years 4 months ago
2003
Springer
A new public-key model for resettable zero-knowledge (rZK) protocols, which is an extension and generalization of the upper-bounded public-key (UPK) model introduced by Micali and ...
STOC
1994
ACM
15 years 3 months ago
1994
ACM
We present new results on the well-studied problem of learning DNF expressions. We prove that an algorithm due to Kushilevitz and Mansour [13] can be used to weakly learn DNF form...