Implicit computational complexity and probabilistic classes
The thesis applies the ICC tecniques to the probabilistic polinomial complexity classes in order to get an implicit characterization of them. The main contribution lays on the implicit characterization of PP (which stands for Probabilistic Polynomial Time) class, showing a syntactical characterisati...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Doctoral Thesis |
| Language: | en |
| Published: |
Alma Mater Studiorum - Università di Bologna
2013
|
| Subjects: | |
| Online Access: | http://amsdottorato.unibo.it/5573/ |