Monotone Circuits for the Majority Function
From MaRDI portal
Recommendations
- Threshold functions and bounded depth monotone circuits
- Efficient monotone circuits for threshold functions
- Short monotone formulae for the majority function
- Addition is exponentially harder than counting for shallow monotone circuits
- Computing majority by constant depth majority circuits with low fan-in gates
Cited in
(16)- Threshold functions and bounded depth monotone circuits
- Adaptively secure distributed PRFs from LWE
- Adaptively secure distributed PRFs from \(\mathsf{LWE}\)
- Non-interactive CCA2-secure threshold cryptosystems: achieving adaptive security in the standard model without pairings
- Strengthening convex relaxations of 0/1-sets using Boolean formulas
- Short monotone formulae for the majority function
- Expander graphs and their applications
- A hierarchy theorem for interactive proofs of proximity
- Depth two majority circuits for majority and list expanders
- On (Valiant’s) Polynomial-Size Monotone Formula for Majority
- Threshold linearly homomorphic encryption on \(\mathrm{Z}/2^k\mathrm{Z}\)
- Optimal explicit small-depth formulas for the coin problem
- Towards simpler sorting networks and monotone circuits for majority
- Partially non-interactive two-round lattice-based threshold signatures
- Improved universal thresholdizer from iterative Shamir secret sharing
- Pilvi: lattice threshold PKE with small decryption shares and improved security
This page was built for publication: Monotone Circuits for the Majority Function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3595404)
