The complexity of meta-computational problems
<p>This thesis focuses on problems which themselves encode questions about circuits or algorithms, also called meta-computational problems. The thesis is centered on meta-computational problems like C-MCSP (minimum circuit size problem), C-Learnability and C-Satisfiability, for some circuit cl...
| Главный автор: | |
|---|---|
| Другие авторы: | |
| Формат: | Диссертация |
| Язык: | English |
| Опубликовано: |
2020
|
| Предметы: |