20 search results - page 3 / 4 » Cryptographic Hardness Results for Learning Intersections of... |
COMPGEOM
1995
ACM
13 years 9 months ago
1995
ACM
A convex polytope P can be speci ed in two ways: as the convex hull of the vertex set V of P, or as the intersection of the set H of its facet-inducing halfspaces. The vertex enum...
ICS
2010
Tsinghua U.
14 years 3 months ago
2010
Tsinghua U.
: Starting with the work of Ishai-Sahai-Wagner and Micali-Reyzin, a new goal has been set within the theory of cryptography community, to design cryptographic primitives that are s...
STOC
2003
ACM
14 years 6 months ago
2003
ACM
A real multivariate polynomial p(x1, . . . , xn) is said to sign-represent a Boolean function f : {0, 1}n {-1, 1} if the sign of p(x) equals f(x) for all inputs x {0, 1}n. We gi...
FOCS
2008
IEEE
14 years 18 days ago
2008
IEEE
We study the learnability of sets in Rn under the Gaussian distribution, taking Gaussian surface area as the “complexity measure” of the sets being learned. Let CS denote the ...
JSW
2007
13 years 6 months ago
2007
—This paper presents some results in the intersection of three technological fields: e-learning, multiagent systems, and standards to improve the development of secure systems. T...