The following pages link to Frederic Green (Q751271):
Displayed 18 items.
- An oracle separating \(\oplus P\) from \(PP^{PH}\) (Q751272) (← links)
- Uniqueness of optimal mod 3 polynomials for parity (Q962998) (← links)
- A complex-number Fourier technique for lower bounds on the mod-\(m\) degree (Q1590080) (← links)
- Relativized separation of EQP from \(\text{P}^{\text{NP}}\) (Q1607126) (← links)
- The correlation between parity and quadratic polynomials mod \(3\) (Q1881261) (← links)
- The power of the middle bit of a \(\#\)P function (Q1894453) (← links)
- Block-symmetric polynomials correlate with parity better than symmetric (Q2410677) (← links)
- Bounds on an exponential sum arising in Boolean circuit complexity (Q2565522) (← links)
- (Q3187179) (← links)
- (Q3793734) (← links)
- On the power of deterministic reductions to C=P (Q4032933) (← links)
- (Q4259998) (← links)
- Lower bounds for depth-three circuits with equals and mod-gates (Q4596611) (← links)
- On the correlation of symmetric functions (Q4879208) (← links)
- Determining acceptance possibility for a quantum computation is hard for the polynomial hierarchy (Q4946417) (← links)
- Efficient Universal Quantum Circuits (Q5323090) (← links)
- Fundamentals of Computation Theory (Q5492915) (← links)
- Fixed-Parameter Extrapolation and Aperiodic Order (Q6237968) (← links)