Sciweavers

32 search results - page 7 / 7
» Polynomial Interpolation of the Discrete Logarithm
Sort
View
COCO
2010
Springer
153views Algorithms» more  COCO 2010»
13 years 9 months ago
Communication Complexity with Synchronized Clocks
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...
Russell Impagliazzo, Ryan Williams
FOCS
1998
IEEE
13 years 9 months ago
The Complexity of Acyclic Conjunctive Queries
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...
Georg Gottlob, Nicola Leone, Francesco Scarcello