31 search results - page 3 / 7 » icalp 2001 |
ICALP
2001
Springer
13 years 9 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 9 months ago
2001
Springer
In this paper we initiate the study of testing properties of hypergraphs. The goal of property testing is to distinguish between the case whether a given object has a certain prope...
ICALP
2001
Springer
13 years 9 months ago
2001
Springer
A cryptographic protocol can be described as a system of concurrent processes, and analysis of the traces generated by this system can be used to verify authentication and secrecy ...
ICALP
2001
Springer
13 years 9 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 9 months ago
2001
Springer
We prove a lower bound of (n4/3 log1/3 n) on the randomized decision tree complexity of any nontrivial monotone n-vertex graph property, and of any nontrivial monotone bipartite g...