Characterizing Average-Case Complexity of PH by Worst-Case Meta-Complexity

We exactly characterize the average-case complexity of the polynomial-time hierarchy (PH) by the worst-case (meta-)complexity of GapMINKT PH , i.e., an approximation version of the problem of determining if a given string can be compressed to a short PH-oracle efficient program. Specifically, we est...

Full description

Bibliographic Details

Published in:	Proceedings / annual Symposium on Foundations of Computer Science pp. 50 - 60
Main Author:	Hirahara, Shuichi
Format:	Conference Proceeding
Language:	English
Published:	IEEE 01.11.2020
Subjects:	average-case complexity Complexity theory Generators hardness amplification Heuristic algorithms hitting set generator Kolmogorov complexity Marine vehicles meta-complexity polynomial-time hierarchy pseudorandomness Reconstruction algorithms Task analysis Turing machines
ISSN:	2575-8454
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!