Polynomial size circuits with low resource-bounded Kolmogorov complexity
It is well-known that the class P/poly can be characterized in terms of polynomial size circuits. We obtain a characterization of the class P/log using polynomial size circuits with low resource-bounded Kolmogorov Complexity. The concept of "small circuits with easy descriptions" has been...
| Autores: | , |
|---|---|
| Tipo de recurso: | informe técnico |
| Fecha de publicación: | 1991 |
| País: | España |
| Institución: | Universitat Politècnica de Catalunya (UPC) |
| Repositorio: | UPCommons. Portal del coneixement obert de la UPC |
| Idioma: | inglés |
| OAI Identifier: | oai:upcommons.upc.edu:2117/329306 |
| Acceso en línea: | https://hdl.handle.net/2117/329306 |
| Access Level: | acceso abierto |
| Palabra clave: | Polynomials Polinomis Àrees temàtiques de la UPC::Informàtica |
| Sumario: | It is well-known that the class P/poly can be characterized in terms of polynomial size circuits. We obtain a characterization of the class P/log using polynomial size circuits with low resource-bounded Kolmogorov Complexity. The concept of "small circuits with easy descriptions" has been introduced in the literature as a candidate to characterizing P/log. We prove that this concept doesn't correspond exactly to P/log but to P/O(log n * log(log n)), and that this class is different from the previous one. Generalizations of this result are also obtained. |
|---|