Pages that link to "Item:Q619913"
From MaRDI portal
The following pages link to Multilinear formulas, maximal-partition discrepancy and mixed-sources extractors (Q619913):
Displaying 12 items.
- Lower bounds for monotone counting circuits (Q313809) (← links)
- Lower bounds for tropical circuits and dynamic programs (Q493653) (← links)
- Non-malleable coding against bit-wise and split-state tampering (Q514470) (← links)
- Building above read-once polynomials: identity testing and hardness of representation (Q727964) (← links)
- An \(\mathrm{Omega}((n \log n)/R)\) lower bound for Fourier transform computation in the \(R\)-well conditioned model (Q2828217) (← links)
- Tropical complexity, Sidon sets, and dynamic programming (Q2832574) (← links)
- Exact Parameterized Multilinear Monomial Counting via k-Layer Subset Convolution and k-Disjoint Sum (Q3087940) (← links)
- Monotone circuit lower bounds from robust sunflowers (Q5970784) (← links)
- Shadows of Newton polytopes (Q6076195) (← links)
- Monotone arithmetic complexity of graph homomorphism polynomials (Q6077890) (← links)
- Monotone classes beyond VNP (Q6589844) (← links)
- Notes on Boolean read-\(k\) and multilinear circuits (Q6648273) (← links)
