Titlebook: STACS 2000; 17th Annual Symposiu Horst Reichel,Sophie Tison Conference proceedings 2000 Springer-Verlag Berlin Heidelberg 2000 Automat.algo

Hallowed

Two-Variable Word Equations,unctions that give the number of words of a given length. Specifically, we prove that there are only five types of complexities: constant, linear, exponential, and two in between constant and linear. For the latter two, we give precise characterizations in terms of the number of solutions of Diophan

他很靈活

Average-Case Quantum Query Complexity,al can be at most polynomial [.]. We show that for . complexity under the uniform distribution, quantum algorithms can be exponentially faster than classical algorithms. Under non-uniform distributions the gap can even be super-exponential. We also prove some general bounds for average-case complexi

PANEL

希望

The Data Broadcast Problem with Preemption,o clients requesting messages, and the cost of the broadcast. This is an efficient means of disseminating data to clients, designed for environments, such as satellites, cable TV, mobile phones, where there is a much larger capacity from the information source to the clients than in the reverse dire

無能力

An Approximate ,,-Difference Algorithm for Massive Data Streams,. and . . are given in a data stream, and their order is chosen by an adversary. These algorithms use little space (much less than would be needed to store the entire stream) and little time to process each item in the stream and give approximations with small relative error. Using different techniq

血友病

Succinct Representations of Model Based Belief Revision,ctly represent a certain set of models. In particular, we show that some of these operators are more efficient than others, even though they have the sane model checking complexity. We show that these operators are partially ordered, i.e. some of them are not comparable. We also strengthen some of t

formula

Oratory

截?cái)?/a>

asthma