Pages that link to "Item:Q3496345"
From MaRDI portal
The following pages link to Linear Circuits over $\operatorname{GF}(2)$ (Q3496345):
Displaying 13 items.
- Separating OR, SUM, and XOR circuits (Q269494) (← links)
- Min-rank conjecture for log-depth circuits (Q657911) (← links)
- Entropy of operators or why matrix multiplication is hard for depth-two circuits (Q970107) (← links)
- Representing \((0,1)\)-matrices by Boolean circuits (Q1045160) (← links)
- Some combinatorial-algebraic problems from complexity theory (Q1344621) (← links)
- Circuit complexity of linear functions: gate elimination and feeble security (Q1946842) (← links)
- Cancellation-free circuits in unbounded and bounded depth (Q2348031) (← links)
- Arithmetic complexity of certain linear transformations (Q2352607) (← links)
- The arithmetic computational complexity of linear transforms (Q2356497) (← links)
- Gate Elimination for Linear Functions and New Feebly Secure Constructions (Q3007624) (← links)
- On complexity of linear operators on the class of circuits of depth 2 (Q3184524) (← links)
- On set intersection representations of graphs (Q3633007) (← links)
- Efficient Construction of Rigid Matrices Using an NP Oracle (Q5863325) (← links)
