903 search results - page 72 / 181 » On the reduction of a random basis |
160
click to vote
STOC
2005
ACM
16 years 6 months ago
2005
ACM
We continue the study of amplification of average-case complexity within NP, and we focus on the uniform case. We prove that if every problem in NP admits an efficient uniform alg...
146
click to vote
EUROCRYPT
2007
Springer
16 years 10 days ago
2007
Springer
Abstract. We present two universally composable and practical protocols by which a dealer can, verifiably and non-interactively, secret-share an integer among a set of players. Mo...
118
click to vote
ICCS
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. In this paper we extend our previous result on reusing shooting paths when dealing with moving light sources in radiosity to the final gathering step algorithm, which co...
169
click to vote
ISVLSI
2003
IEEE
15 years 11 months ago
2003
IEEE
This paper describes a technique for re-ordering of scan cells to minimize power dissipation that is also capable of reducing the area overhead of the circuit compared to a random...
158
click to vote
FOCS
2000
IEEE
15 years 10 months ago
2000
IEEE
We show that the graph isomorphism problem is hard under DLOGTIME uniform AC0 many-one reductions for the complexity classes NL, PL (probabilistic logarithmic space) for every loga...