Pages that link to "Item:Q5346309"
From MaRDI portal
The following pages link to Tight Bounds on Computing Error-Correcting Codes by Bounded-Depth Circuits With Arbitrary Gates (Q5346309):
Displaying 5 items.
- Bounded-depth circuits cannot sample good codes (Q692999) (← links)
- Lower bounds for matrix factorization (Q2041242) (← links)
- Tight and Rigorous Error Bounds for Basic Building Blocks of Double-Word Arithmetic (Q4581373) (← links)
- Lower bounds for matrix factorization (Q5092452) (← links)
- On the minimum depth of circuits with linear number of wires encoding good codes (Q6591658) (← links)