234 search results - page 22 / 47 » On the relative complexity of approximate counting problems |
117
Voted
CRYPTO
2008
Springer
15 years 3 months ago
2008
Springer
We construct noninteractive statistical zero-knowledge (NISZK) proof systems for a variety of standard approximation problems on lattices, such as the shortest independent vectors...
164
click to vote
ICDM2
2004
Springer
15 years 7 months ago
2004
Springer
Vehicle production audit tests, warranty claims and car control unit data are stored in a central data warehouse for data mining analysis. Neural network based part failure rate es...
124
click to vote
SIAMJO
2008
15 years 1 months ago
2008
Given A := {a1, . . . , am} Rn and > 0, we propose and analyze two algorithms for the problem of computing a (1 + )-approximation to the radius of the minimum enclosing ball o...
125
click to vote
JCSS
2008
15 years 1 months ago
2008
Given a Boolean function f, we study two natural generalizations of the certificate complexity C (f): the randomized certificate complexity RC (f) and the quantum certificate comp...
121
click to vote
COCO
2009
Springer
15 years 8 months ago
2009
Springer
—The Gap-Hamming-Distance problem arose in the context of proving space lower bounds for a number of key problems in the data stream model. In this problem, Alice and Bob have to...