Vai al contenuto principale della pagina
| Titolo: |
16th IEEE Annual Conference on Computational Complexity (CCC 2001)
|
| Pubblicazione: | [Place of publication not identified], : IEEE Computer Society Press, 2001 |
| Descrizione fisica: | 1 online resource |
| Disciplina: | 511.3 |
| Soggetto topico: | Computational complexity |
| Computational complexity - Data processing | |
| Note generali: | Bibliographic Level Mode of Issuance: Monograph |
| Sommario/riassunto: | The proceedings from the June 2001 conference in Chicago comprise 30 papers on topics like exponential time and probabilistic polynomial time, monotone simulations and nonmonotone proofs, bounded query functions, strong direct product theorems, quantum algorithms, non- linear secret sharing, Complexity theory and constrained block coding, Kolmogrov complexity, and time-space trade-offs. Author index only. c. Book News Inc. |
| Titolo autorizzato: | 16th IEEE Annual Conference on Computational Complexity (CCC 2001) ![]() |
| Formato: | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione: | Inglese |
| Record Nr.: | 9910872874503321 |
| Lo trovi qui: | Univ. Federico II |
| Opac: | Controlla la disponibilità qui |