Kolmogorov complexity of #P functions
Are the outputs of #P functions "random"? We way phrase this question more precisely: are there #P functions whose outputs cannot in general be compressed into a string of small length, and recovered quickly from that string, also given the input as additional information? We prove that th...
| 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/328177 |
| Acceso en línea: | https://hdl.handle.net/2117/328177 |
| Access Level: | acceso abierto |
| Palabra clave: | Polynomials Polinomis Àrees temàtiques de la UPC::Informàtica |
| Sumario: | Are the outputs of #P functions "random"? We way phrase this question more precisely: are there #P functions whose outputs cannot in general be compressed into a string of small length, and recovered quickly from that string, also given the input as additional information? We prove that the answer to this question is "yes" if and only if P ¿ PP. |
|---|