Sciweavers

32 search results - page 7 / 7
» Relativizing Small Complexity Classes and Their Theories
Sort
View
ACMSE
2006
ACM
13 years 9 months ago
Achieving efficient polynomial multiplication in fermat fields using the fast Fourier transform
We introduce an efficient way of performing polynomial multiplication in a class of finite fields GF(pm ) in the frequency domain. The Fast Fourier Transform (FFT) based frequency...
Selçuk Baktir, Berk Sunar
ECCC
2010
98views more  ECCC 2010»
13 years 3 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