Pages that link to "Item:Q4696225"
From MaRDI portal
The following pages link to Shrinkage of de Morgan formulae under restriction (Q4696225):
Displaying 19 items.
- An improved deterministic \#SAT algorithm for small De Morgan formulas (Q334923) (← links)
- Negation-limited formulas (Q729897) (← links)
- On the shrinkage exponent for read-once formulae (Q1367534) (← links)
- Toward the KRW composition conjecture: cubic formula lower bounds via communication complexity (Q1616616) (← links)
- Fourier concentration from shrinkage (Q2012185) (← links)
- Mining circuit lower bound proofs for meta-algorithms (Q2351392) (← links)
- $$P\mathop{ =}\limits^{?}NP$$ (Q2826803) (← 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)
- Toward Better Formula Lower Bounds: The Composition of a Function and a Universal Relation (Q2968148) (← links)
- Improved Algorithms for Sparse MAX-SAT and MAX-k-CSP (Q3453207) (← links)
- How Do Read-Once Formulae Shrink? (Q4325332) (← links)
- (Q5002674) (← 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 de morgan formulas of low-communication leaf gates (Q5092464) (← links)
- Natural proofs (Q5906823) (← links)
- Improving \(3N\) circuit complexity lower bounds (Q6184294) (← links)
