Pages that link to "Item:Q1103591"
From MaRDI portal
The following pages link to A method for obtaining more than quadratic effective lower estimates of complexity of \(\pi\) schemes (Q1103591):
Displaying 18 items.
- A satisfiability algorithm and average-case hardness for formulas over the full binary basis (Q354655) (← links)
- On convex complexity measures (Q964405) (← links)
- On almost bad Boolean bases (Q1349706) (← links)
- On the shrinkage exponent for read-once formulae (Q1367534) (← links)
- Matrix rigidity of random Toeplitz matrices (Q1653338) (← links)
- Super-logarithmic depth lower bounds via the direct sum in communication complexity (Q1918946) (← links)
- \(n^{{\Omega{}}(\log{} n)}\) lower bounds on the size of depth-3 threshold circuits with AND gates at the bottom (Q2365817) (← links)
- Circuit lower bounds from learning-theoretic approaches (Q2636410) (← links)
- $$P\mathop{ =}\limits^{?}NP$$ (Q2826803) (← 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)
- (Q5002674) (← links)
- (Q5002692) (← 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)
- A super-quadratic lower bound for depth four arithmetic circuits (Q5092474) (← links)
- Natural proofs (Q5906823) (← links)
- Improving \(3N\) circuit complexity lower bounds (Q6184294) (← links)
