467 search results - page 49 / 94 » The Complexity of Polynomials and Their Coefficient Function... |
SIGECOM
2009
ACM
15 years 6 months ago
2009
ACM
Policy teaching considers a Markov Decision Process setting in which an interested party aims to influence an agent’s decisions by providing limited incentives. In this paper, ...
ISTCS
1995
Springer
15 years 3 months ago
1995
Springer
A low-degree test is a collection of simple, local rules for checking the proximity of an arbitrary function to a lowdegree polynomial. Each rule depends on the function’s value...
EUROCRYPT
2004
Springer
15 years 5 months ago
2004
Springer
We revisit the following open problem in information-theoretic cryptography: Does the communication complexity of unconditionally secure computation depend on the computational com...
FOCS
1989
IEEE
15 years 3 months ago
1989
IEEE
In this paper, Boolean functions in ,4C0 are studied using harmonic analysis on the cube. The main result is that an ACO Boolean function has almost all of its “power spectrum”...
SIGECOM
2004
ACM
15 years 5 months ago
2004
ACM
We consider the parallels between the preference elicitation problem in combinatorial auctions and the problem of learning an unknown function from learning theory. We show that l...