Linear-size Boolean circuits for multiselection
From MaRDI portal
Cites work
- A 2.5n-Lower Bound on the Combinational Complexity of Boolean Functions
- A Boolean function requiring 3n network size
- A method for obtaining more than quadratic effective lower estimates of complexity of schemes
- A relational model of data for large shared data banks
- Batch codes and their applications
- Can we access a database both locally and privately?
- Faster sounder succinct arguments and \textsf{IOP}s
- Fully homomorphic encryption with polylog overhead
- scientific article; zbMATH DE number 1033441 (Why is no real title available?)
- scientific article; zbMATH DE number 1759771 (Why is no real title available?)
- scientific article; zbMATH DE number 808799 (Why is no real title available?)
- scientific article; zbMATH DE number 3257409 (Why is no real title available?)
- Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles
- Oblivious parallel tight compaction
- Optimal sorting circuits for short keys
- OptORAMa: optimal oblivious RAM
- Parallel Prefix Computation
- Private information retrieval
- Proving as fast as computing: succinct arguments with constant prover overhead
- Self-routing superconcentrators
- Sorting Short Keys in Circuits of Size ${o(n \log n)}$
- Towards doubly efficient private information retrieval
Cited in
(2)
This page was built for publication: Linear-size Boolean circuits for multiselection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6866486)
