552 search results - page 79 / 111 » On the Complexity of Join Predicates |
ICALP
2001
Springer
14 years 5 days ago
2001
Springer
Abstract. We present the first private information retrieval (PIR) scheme which is both, deterministically correct and has poly-logarithmic communication complexity. Our PIR proto...
MMMACNS
2001
Springer
14 years 3 days ago
2001
Springer
Abstract. Many design flaws and incorrect analyses of cryptographic protoAppeared in the Proceedings of the First International Workshop on Mathematical Methods, Models and Archit...
LICS
1999
IEEE
13 years 12 months ago
1999
IEEE
The ordered conjecture states that least fixed-point logic LFP is strictly more expressive than first-order logic FO on every infinite class of ordered finite structures. It has b...
ILP
1998
Springer
13 years 12 months ago
1998
Springer
This paper describes a new kind of language bias, S-structural indeterminate clauses, which takes into account the meaning of predicates that play a key role in the complexity of l...
LPNMR
1997
Springer
13 years 12 months ago
1997
Springer
Turi [20] introduced the important notion of a constrained atom: an atom with associated equality and disequality constraints on its arguments. A set of constrained atoms is a cons...