Pages that link to "Item:Q5495787"
From MaRDI portal
The following pages link to Average-case lower bounds for formula size (Q5495787):
Displayed 15 items.
- An improved deterministic \#SAT algorithm for small De Morgan formulas (Q334923) (← links)
- Correlation bounds and \#SAT algorithms for small linear-size circuits (Q344759) (← links)
- Negation-limited formulas (Q729897) (← links)
- Toward the KRW composition conjecture: cubic formula lower bounds via communication complexity (Q1616616) (← links)
- Gate elimination: circuit size lower bounds and \#SAT upper bounds (Q1704573) (← links)
- Fourier concentration from shrinkage (Q2012185) (← links)
- Mining circuit lower bound proofs for meta-algorithms (Q2351392) (← links)
- Satisfiability Algorithms and Lower Bounds for Boolean Formulas over Finite Bases (Q2946392) (← links)
- Improved Average-Case Lower Bounds for De Morgan Formula Size: Matching Worst-Case Lower Bound (Q2963581) (← links)
- Correlation Bounds and #SAT Algorithms for Small Linear-Size Circuits (Q3196385) (← links)
- Average-Case Lower Bounds and Satisfiability Algorithms for Small Threshold Circuits (Q4568115) (← links)
- (Q5002692) (← links)
- Quantified Derandomization: How to Find Water in the Ocean (Q5060673) (← links)
- Cubic Formula Size Lower Bounds Based on Compositions with Majority (Q5090412) (← links)
- Algorithms and lower bounds for comparator circuits from shrinkage (Q6107895) (← links)