Sciweavers

Share
ICALP
2001
Springer
10 years 11 days ago
Separating Quantum and Classical Learning
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...
Rocco A. Servedio
ICALP
2001
Springer
10 years 11 days ago
On the Approximability of Average Completion Time Scheduling under Precedence Constraints
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...
Gerhard J. Woeginger
ICALP
2001
Springer
10 years 11 days ago
Minimal Tail-Biting Trellises for Certain Cyclic Block Codes Are Easy to Construct
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 ...
Priti Shankar, P. N. A. Kumar, Harmeet Singh, B. S...
ICALP
2001
Springer
10 years 11 days ago
Combinatorics of Periods in Strings
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...
Eric Rivals, Sven Rahmann
ICALP
2001
Springer
10 years 11 days ago
Secure Games with Polynomial Expressions
Abstract. We present the first private information retrieval (PIR) scheme which is both, deterministically correct and has poly-logarithmic communication complexity. Our PIR proto...
Aggelos Kiayias, Moti Yung
ICALP
2001
Springer
10 years 11 days ago
Communication Gap for Finite Memory Devices
Tomasz Jurdzinski, Miroslaw Kutylowski
ICALP
2001
Springer
10 years 11 days ago
Quantum Complexities of Ordered Searching, Sorting, and Element Distinctness
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...
Peter Høyer, Jan Neerbek, Yaoyun Shi
ICALP
2001
Springer
10 years 11 days ago
An Axiomatic Approach to Metareasoning on Nominal Algebras in HOAS
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)....
Furio Honsell, Marino Miculan, Ivan Scagnetto
ICALP
2001
Springer
10 years 11 days ago
The Complexity of Computing the Size of an Interval
Lane A. Hemaspaandra, Sven Kosub, Klaus W. Wagner
books