The following pages link to The complexity of DNF of parities (Q2800552):
Displaying 11 items.
- Gate elimination: circuit size lower bounds and \#SAT upper bounds (Q1704573) (← links)
- Property testing lower bounds via a generalization of randomized parity decision trees (Q1999996) (← links)
- Expander-based cryptography meets natural proofs (Q2125080) (← links)
- Hilbert cubes meet arithmetic sets (Q2197517) (← links)
- (Q3783561) (← links)
- (Q5028429) (← links)
- Expander-Based Cryptography Meets Natural Proofs (Q5090391) (← links)
- (Q5092472) (← links)
- (Q5121893) (← links)
- Mathematical Foundations of Computer Science 2005 (Q5492876) (← links)
- Improving \(3N\) circuit complexity lower bounds (Q6184294) (← links)