Sciweavers

233 search results - page 8 / 47
» Interactive Proofs For Quantum Computations
Sort
View
IPL
2006
104views more  IPL 2006»
14 years 11 months ago
The communication complexity of the Hamming distance problem
We investigate the randomized and quantum communication complexity of the HAMMING DISTANCE problem, which is to determine if the Hamming distance between two n-bit strings is no l...
Wei Huang, Yaoyun Shi, Shengyu Zhang, Yufan Zhu
STACS
1997
Springer
15 years 3 months ago
Probabilistic Proof Systems - A Survey
Various types of probabilistic proof systems have played a central role in the development of computer science in the last decade. In this exposition, we concentrate on three such...
Oded Goldreich
CHI
2006
ACM
16 years 2 days ago
"Sketching" nurturing creativity: commonalities in art, design, engineering and research
icians or philosophers use abstract symbols to derive formulas or form proofs. Indeed, these sketches are structural geometric proofs, consistent with Plato's supposition that...
Kumiyo Nakakoji, Atau Tanaka, Daniel Fallman
VIS
2009
IEEE
430views Visualization» more  VIS 2009»
15 years 9 months ago
Interactive Volume Rendering of Functional Representations in Quantum Chemistry
Simulation and computation in chemistry studies have been improved as computational power has increased over decades. Many types of chemistry simulation results are available, from...
Yun Jang and Ugo Varetto
ECCC
2010
98views more  ECCC 2010»
14 years 10 months ago
Verifying Computations with Streaming Interactive Proofs
Applications based on outsourcing computation require guarantees to the data owner that the desired computation has been performed correctly by the service provider. Methods based...
Graham Cormode, Justin Thaler, Ke Yi