A short overview of Kolmogorov complexity and its application for proving lower bounds of algorithms
نویسنده
چکیده
منابع مشابه
/ 06 11 05 4 v 2 2 4 A pr 2 00 7 Negative weights make adversaries stronger
The quantum adversary method is one of the most successful techniques for proving lower bounds on quantum query complexity. It gives optimal lower bounds for many problems, has application to classical complexity in formula size lower bounds, and is versatile with equivalent formulations in terms of weight schemes, eigenvalues, and Kolmogorov complexity. All these formulations rely on the princ...
متن کاملCircuit Complexity, Kolmogorov Complexity, and Prospects for Lower Bounds
This invited Descriptional Complexity of Formal Systems lecture provides an opportunity to raise awareness of the tight connection that exists between Kolmogorov Complexity and Circuit Complexity, and to argue that this connection is useful and interesting. Kolmogorov complexity has been used to provide examples of complete sets for classes such as EXP and PSPACE that are fundamentally differen...
متن کاملString Recognition on Anonymous Rings
We consider the problem of recognizing whether a given binary string of length n is equal (up to rotation) to the input of an anonymous oriented ring of n processors. Previous algorithms for this problem have been \global" and do not take into account \local" patterns occurring in the string. Such patterns may be repetitive or discriminating, and can be used to provide eecient algorithms for re...
متن کاملnt - p h / 06 11 05 4 v 1 5 N ov 2 00 6 Negative weights makes adversaries stronger
The quantum adversary method is one of the most successful techniques for proving lower bounds on quantum query complexity. It gives optimal lower bounds for many problems, has application to classical complexity in formula size lower bounds, and is versatile with equivalent formulations in terms of weight schemes, eigenvalues, and Kolmogorov complexity. All these formulations are information-t...
متن کاملA Survey on Stability Measure of Networks
In this paper we discuss about tenacity and its properties in stability calculation. We indicate relationships between tenacity and connectivity, tenacity and binding number, tenacity and toughness. We also give good lower and upper bounds for tenacity.
متن کامل