Pages that link to "Item:Q5449840"
From MaRDI portal
The following pages link to Constant-Depth Circuits for Arithmetic in Finite Fields of Characteristic Two (Q5449840):
Displaying 9 items.
- Perfect secure computation in two rounds (Q1629404) (← links)
- Local expanders (Q1653336) (← links)
- Dynamic complexity of expansion (Q2117075) (← links)
- Efficient Sample Extractors for Juntas with Applications (Q3012831) (← links)
- On "A new representation of elements of finite fields GF(2/sup m/) yielding small complexity arithmetic circuits" (Q4571241) (← links)
- Quantum Hardness of Learning Shallow Classical Circuits (Q4994987) (← links)
- Worst-Case to Average-Case Reductions for Subclasses of P (Q5098780) (← links)
- Perfect Secure Computation in Two Rounds (Q5149757) (← links)
- On the complexity of algebraic numbers, and the bit-complexity of straight-line programs1 (Q6048002) (← links)
