13603 search results - page 54 / 2721 » On the Computational Complexity of Cut-Reduction |
IBMRD
2011
14 years 4 months ago
2011
MFCS
1990
Springer
15 years 1 months ago
1990
Springer
We introduce the notion of associative one-way functions and prove that they exist if and only if P 6= NP. As evidence of their utility, we present two novel protocols that apply ...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
Maximum likelihood estimators are often of limited practical use due to the intensive computation they require. We propose a family of alternative estimators that maximize a stoch...
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
The fundamental problem of our interest is soft MIMO detection for the case of block fading, i.e., when the transmitted codeword spans over several independent channel realization...
RT
1998
Springer
15 years 2 months ago
1998
Springer
Abstract. There has been great success in speeding up global illumination computation in diffuse environments. The concept of clustering allows radiosity computations even for scen...