6300 search results - page 8 / 1260 » We have it easy, but do we have it right |
ECCC
2007
13 years 8 months ago
2007
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...
JOT
2008
13 years 8 months ago
2008
There is large room for improving the usefulness of today's Internet search engines. There are various ways. One of the ways is, when given a sub-directory (subWeb) of a Web ...
CIE
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. We prove a uniformly computable version of de Finetti’s theorem on exchangeable sequences of real random variables. In the process, we develop machinery for computably ...
BMCBI
2005
13 years 8 months ago
2005
Background: Routine application of gene expression microarray technology is rapidly producing large amounts of data that necessitate new approaches of analysis. The analysis of a ...
CCR
2006
13 years 8 months ago
2006
If despite your better judgment you decide to read this article, keep in mind that it was written during the summer, and this has been the hottest summer ever. To avoid such artic...