47 search results - page 10 / 10 » Solving a 676-Bit Discrete Logarithm Problem in GF(36n) |
FOCS
1998
IEEE
13 years 10 months ago
1998
IEEE
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
COCO
2010
Springer
13 years 9 months ago
2010
Springer
Abstract—We consider two natural extensions of the communication complexity model that are inspired by distributed computing. In both models, two parties are equipped with synchr...