Pages that link to "Item:Q1108794"
From MaRDI portal
The following pages link to Random oracles separate PSPACE from the polynomial-time hierarchy (Q1108794):
Displaying 23 items.
- Cryptography with constant input locality (Q1037233) (← links)
- Circuit size relative to pseudorandom oracles (Q1208410) (← links)
- The generic oracle hypothesis is false (Q1209320) (← links)
- The power of adaptiveness and additional queries in random-self- reductions (Q1332664) (← links)
- When do extra majority gates help? Polylog\((N)\) majority gates are equivalent to one (Q1346613) (← links)
- Enumerative counting is hard (Q1822963) (← links)
- Hardness of learning problems over Burnside groups of exponent 3 (Q2339133) (← links)
- Finite Groups and Complexity Theory: From Leningrad to Saint Petersburg via Las Vegas (Q3007625) (← links)
- Parity, circuits, and the polynomial-time hierarchy (Q3318683) (← links)
- Interleaved Group Products (Q4634030) (← links)
- On the correlation of symmetric functions (Q4717052) (← links)
- On closure properties of bounded two-sided error complexity classes (Q4835865) (← links)
- On the correlation of symmetric functions (Q4879208) (← links)
- Strong self-reducibility precludes strong immunity (Q4895818) (← links)
- An information-theoretic treatment of random-self-reducibility (Q5048951) (← links)
- (Q5077146) (← links)
- Strong Average-Case Circuit Lower Bounds from Nontrivial Derandomization (Q5080481) (← links)
- On the Size of Depth-Three Boolean Circuits for Computing Multilinear Functions (Q5098770) (← links)
- Worst-Case to Average-Case Reductions for Subclasses of P (Q5098780) (← links)
- Sampling Lower Bounds: Boolean Average-Case and Permutations (Q5216796) (← links)
- On the power of parity polynomial time (Q5750401) (← links)
- (Q5875501) (← links)
- Borel complexity and Ramsey largeness of sets of oracles separating complexity classes (Q6096803) (← links)
