The following pages link to Andrew Wan (Q628301):
Displaying 19 items.
- Learning random monotone DNF (Q628302) (← links)
- Efficiently testing sparse \(\text{GF}(2)\) polynomials (Q644810) (← links)
- DNF are teachable in the average case (Q1009216) (← links)
- Computing sparse permanents faster (Q1044712) (← links)
- (Q2969669) (← links)
- Faster private release of marginals on small databases (Q2988893) (← links)
- (Q3002813) (← links)
- Pseudorandomness for Linear Length Branching Programs and Stack Machines (Q3167416) (← links)
- (Q3174077) (← links)
- (Q3191611) (← links)
- (Q3466401) (← links)
- Optimal Cryptographic Hardness of Learning Monotone Functions (Q3521906) (← links)
- Efficiently Testing Sparse GF(2) Polynomials (Q3521943) (← links)
- Learning Random Monotone DNF (Q3541814) (← links)
- (Q4591372) (← links)
- DNF Are Teachable in the Average Case (Q5307570) (← links)
- Approximate resilience, monotonicity, and the complexity of agnostic learning (Q5363038) (← links)
- Learning Theory (Q5473643) (← links)
- Pseudorandomness for Read-Once Formulas (Q5494968) (← links)
