2576 search results - page 100 / 516 » The Complexity of Zero Knowledge |
124
click to vote
CORR
1998
Springer
15 years 4 months ago
1998
Springer
Abstract. Consider a system F of n polynomial equations in n unknowns, over an algebraically closed field of arbitrary characteristic. We present a fast method to find a point in...
144
Voted
RAS
2007
15 years 4 months ago
2007
Developing real robots that can exploit dynamic interactions with the environment requires the use of actuators whose behaviour can vary from high stiffness to complete complianc...
135
click to vote
FSTTCS
2010
Springer
15 years 2 months ago
2010
Springer
A fundamental problem in numerical computation and computational geometry is to determine the sign of arithmetic expressions in radicals. Here we consider the simpler problem of d...
105
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
The stability of low-rank matrix reconstruction is investigated in this paper. The -constrained minimal singular value ( -CMSV) of the measurement operator is shown to determine t...
175
click to vote
CORR
2011
Springer
14 years 11 months ago
2011
Springer
Abstract—We consider a certain class of large random matrices, composed of independent column vectors with zero mean and different covariance matrices, and derive asymptotically ...