Pages that link to "Item:Q5121901"
From MaRDI portal
The following pages link to Hardness vs randomness for bounded depth arithmetic circuits (Q5121901):
Displaying 14 items.
- Bounded-depth circuits cannot sample good codes (Q692999) (← links)
- Hardness hypotheses, derandomization, and circuit complexity (Q937197) (← links)
- Improved hitting set for orbit of ROABPs (Q2087774) (← links)
- Pseudorandom generators hard for \(k\)-DNF resolution and polynomial calculus resolution (Q2255289) (← links)
- Strong Turing degrees for additive BSS RAM's (Q2871478) (← links)
- Stronger lower bounds and randomness-hardness trade-offs using associated algebraic complexity classes (Q2904790) (← links)
- ON THE HARDNESS AGAINST CONSTANT-DEPTH LINEAR-SIZE CIRCUITS (Q3084685) (← links)
- A generalized sylvester-gallai type theorem for quadratic polynomials (Q5092455) (← links)
- (Q5092463) (← links)
- (Q5092488) (← links)
- Sylvester-Gallai type theorems for quadratic polynomials (Q5126776) (← links)
- Closure results for polynomial factorization (Q5204831) (← links)
- (Q5207889) (← links)
- (Q5480947) (← links)