ICALP
2001
Springer
13 years 11 months ago
2001
Springer
We consider a model of learning Boolean functions from quantum membership queries. This model was studied in [26], where it was shown that any class of Boolean functions which is i...
ICALP
2001
Springer
13 years 11 months ago
2001
Springer
Abstract. We consider the scheduling problem of minimizing the average weighted job completion time on a single machine under precedence constraints. We show that this problem with...
ICALP
2001
Springer
13 years 11 months ago
2001
Springer
We give simple algorithms for the construction of generator matrices for minimal tail-biting trellises for a powerful and practical subclass of the linear cyclic codes, from which ...
ICALP
2001
Springer
13 years 11 months ago
2001
Springer
We consider the set Gn of all period sets of strings of length n over a finite alphabet. We show that there is redundancy in period sets and introduce the notion of an irreducibl...
ICALP
2001
Springer
13 years 11 months ago
2001
Springer
ICALP
2001
Springer
13 years 11 months 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...
ICALP
2001
Springer
13 years 11 months ago
2001
Springer
ICALP
2001
Springer
13 years 11 months ago
2001
Springer
We consider the quantum complexities of the following three problems: searching an ordered list, sorting an un-ordered list, and deciding whether the numbers in a list are all dis...
ICALP
2001
Springer
13 years 11 months ago
2001
Springer
We present a logical framework Υ for reasoning on a very general class of languages featuring binding operators, called nominal , presented in higher-order abstract syntax (HOAS)....
ICALP
2001
Springer
13 years 11 months ago
2001
Springer