Approximating the Radii of Point Sets

Authors:
Kasturi Varadarajan;S. Venkatesh;Yinyu Ye;Jiawei Zhang
Affiliations:
-;-;-;-
Venue:
SIAM Journal on Computing
Year:
2007

Citing 0
Cited 3

Complexity Lower Bounds using Linear Algebra

Foundations and Trends® in Theoretical Computer Science
Bypassing UGC from some optimal geometric inapproximability results

Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Algorithms and hardness for subspace approximation

Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

A zap is a 2-round, public coin witness-indistinguishable protocol in which the first round, consisting of a message from the verifier to the prover, can be fixed “once and for all” and applied to any instance. We present a zap for ...