Pages that link to "Item:Q808260"
From MaRDI portal
The following pages link to On the complexity of counting in the polynomial hierarchy (Q808260):
Displaying 4 items.
- The black-box query complexity of polynomial summation (Q626615) (← links)
- Nonerasing, counting, and majority over the linear time hierarchy (Q1854524) (← links)
- The polynomial and linear hierarchies in models where the weak pigeonhole principle fails (Q3503756) (← links)
- Efficient deterministic approximate counting for low-degree polynomial threshold functions (Q5259619) (← links)