1369 search results - page 132 / 274 » Lattice computations for random numbers |
ASIACRYPT
2010
Springer
13 years 7 months ago
2010
Springer
We construct non-interactive zero-knowledge arguments for circuit satisfiability with perfect completeness, perfect zero-knowledge and computational soundness. The non-interactive ...
ISVD
2010
IEEE
13 years 7 months ago
2010
IEEE
An interesting property of the Voronoi tessellation is studied in the context of its application to the analysis of hydration shells in computer simulation of solutions. Namely the...
TCS
2011
13 years 4 months ago
2011
Abstract. We present the first fully dynamic algorithm for computing the characteristic polynomial of a matrix. In the generic symmetric case our algorithm supports rank-one updat...
COMPGEOM
2011
ACM
13 years 20 days ago
2011
ACM
In this paper, we present the first output-sensitive algorithm to compute the persistence diagram of a filtered simplicial complex. For any Γ > 0, it returns only those homo...
COCO
2009
Springer
14 years 3 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...