27 search results - page 3 / 6 » csr 2006 |
CSR
2006
Springer
13 years 11 months ago
2006
Springer
Let Mq (n ) denote the number of multiplications required to compute the coefficients of the product of two polynomials of degree n over a q -element field by means of bilinear alg...
CSR
2006
Springer
13 years 11 months ago
2006
Springer
In this paper we classify several algorithmic problems in group theory in the classes PZK and SZK (problems with perfect/statistical zero-knowledge proofs respectively). Prior to ...
FSTTCS
2006
Springer
13 years 11 months ago
2006
Springer
Termination is one of the most interesting problems when dealing with context-sensitive rewrite systems. Although there is a good number of techniques for proving termination of co...
CSR
2006
Springer
13 years 11 months ago
2006
Springer
A central object of study in the field of algorithmic randomness are notions of randomness for sequences, i.e., infinite sequences of zeros and ones. These notions are usually def...
CSR
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Queries over streaming data offer the potential to provide timely information for modern database applications, such as sensor networks and web services. Isoline-based vi...