Sciweavers

89222 search results - page 26 / 17845
» Which
Sort
View
ECCC
2007
91views more  ECCC 2007»
13 years 8 months ago
Which Languages Have 4-Round Zero-Knowledge Proofs?
We show that if a language L has a 4-round, black-box, computational zero-knowledge proof system with negligible soundness error, then ¯L ∈ MA. Assuming the polynomial hierarch...
Jonathan Katz
JIB
2006
66views more  JIB 2006»
13 years 8 months ago
A First Step towards Learning which uORFs Regulate Gene Expression
Selpi, Christopher H. Bryant, Graham J. L. Kemp, M...