83 citations · 414 across the 29 of their papers we have counts for
1 paper · 1 filter
Sevag Gharibian, Miklos Santha, Jamie Sikora +2
The polynomial-time hierarchy (PH) has proven to be a powerful tool for providing separations in computational complexity theory (modulo standard conjectures such as $\m…