The following pages link to How Do Read-Once Formulae Shrink? (Q4325332):
Displaying 11 items.
- Local restrictions from the Furst-Saxe-Sipser paper (Q519884) (← links)
- Lower bounds on the randomized communication complexity of read-once functions (Q626679) (← links)
- Combinatorial characterization of read-once formulae (Q685684) (← links)
- Negation-limited formulas (Q729897) (← links)
- On the shrinkage exponent for read-once formulae (Q1367534) (← links)
- Fourier concentration from shrinkage (Q2012185) (← links)
- Mining circuit lower bound proofs for meta-algorithms (Q2351392) (← links)
- Depth-Independent Lower Bounds on the Communication Complexity of Read-Once Boolean Formulas (Q3578302) (← links)
- The effect of random restrictions on formula size (Q4696224) (← links)
- The number of Boolean functions computed by formulas of a given size (Q4705331) (← links)
- On the complexity of computing a random Boolean function over the reals (Q5140843) (← links)