Pages that link to "Item:Q1171880"
From MaRDI portal
The following pages link to On counting problems and the polynomial-time hierarchy (Q1171880):
Displaying 21 items.
- On a theorem of Razborov (Q445247) (← links)
- On the complexity of ranking (Q920620) (← links)
- Graph isomorphism problem (Q1057883) (← links)
- On some natural complete operators (Q1064780) (← links)
- The complexity of combinatorial problems with succinct input representation (Q1090455) (← links)
- Some observations on the connection between counting and recursion (Q1098837) (← links)
- Relativized alternation and space-bounded computation (Q1111024) (← links)
- Probabilistic quantifiers and games (Q1112019) (← links)
- Graph isomorphism is in the low hierarchy (Q1116696) (← links)
- Bounded query machines: on NP( ) and NPQUERY( ) (Q1158752) (← links)
- Restricted relativizations of probabilistic polynomial time (Q1186606) (← links)
- Polynomial-time 1-Turing reductions from \(\#\)PH to \(\#\)P (Q1193633) (← links)
- A uniform approach to define complexity classes (Q1200807) (← links)
- Enumerative counting is hard (Q1822963) (← links)
- Nonerasing, counting, and majority over the linear time hierarchy (Q1854524) (← links)
- Phase transitions of PP-complete satisfiability problems (Q2643309) (← links)
- Parity, circuits, and the polynomial-time hierarchy (Q3318683) (← links)
- Nonlevelable sets and immune sets in the accepting density hierarchy inNP (Q3711750) (← links)
- Generix strikes again (Q4735185) (← links)
- A refinement of the low and high hierarchies (Q4841766) (← links)
- UP and the low and high hierarchies: A relativized separation (Q5204316) (← links)
