Pages that link to "Item:Q685723"
From MaRDI portal
The following pages link to Towards optimal simulations of formulas by bounded-width programs (Q685723):
Displaying 8 items.
- Efficient oblivious branching programs for threshold and mod functions (Q1384527) (← links)
- The rise of Paillier: homomorphic secret sharing and public-key silent OT (Q2056710) (← links)
- NIKE from affine determinant programs (Q2697912) (← links)
- Computing bounded reach sets from sampled simulation traces (Q2986775) (← links)
- Computing Algebraic Formulas Using a Constant Number of Registers (Q3990101) (← links)
- Communication Lower Bounds via Critical Block Sensitivity (Q4554052) (← links)
- Branching program size is almost linear in formula size (Q5956012) (← links)
- Multi-key homomorphic secret sharing from LWE without multi-key HE (Q6535488) (← links)