The following pages link to (Q5207889):
Displaying 7 items.
- Factorization of polynomials given by arithmetic branching programs (Q2051373) (← links)
- Pseudorandom generators hard for \(k\)-DNF resolution and polynomial calculus resolution (Q2255289) (← links)
- Stronger lower bounds and randomness-hardness trade-offs using associated algebraic complexity classes (Q2904790) (← links)
- Factorization of polynomials given by arithmetic branching programs (Q5092484) (← links)
- (Q5092488) (← links)
- (Q5480947) (← links)
- Lower bounds for the sum of small-size algebraic branching programs (Q6636102) (← links)