Acceso al sitio web del Consejo de Políticas de Infraestructura

   
ARTÍCULO
TITULO

The Round Complexity of Two-Party Random Selection

Saurabh Sanghvi and Salil Vadhan    

Resumen

No disponible

PÁGINAS
pp. 523 - 550

 Artículos similares

       
 
Marco Baldi, Alessandro Barenghi, Franco Chiaraluce, Gerardo Pelosi and Paolo Santini    
Decoding of random linear block codes has been long exploited as a computationally hard problem on which it is possible to build secure asymmetric cryptosystems. In particular, both correcting an error-affected codeword, and deriving the error vector cor... ver más
Revista: Algorithms