Monotone circuits for monotone weighted threshold functions
From MaRDI portal
Publication:1044746
DOI10.1016/j.ipl.2005.09.008zbMath1184.68227OpenAlexW2046898063MaRDI QIDQ1044746
Publication date: 18 December 2009
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2005.09.008
Data encryption (aspects in computer science) (68P25) Parallel algorithms in computer science (68W10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items
Some results of Maria Serna on strategic games: complexity of equilibria and models, Improved approximation of linear threshold functions, On the characterization of weighted simple games, Cryptography with weights: MPC, encryption and signatures, Positive Neural Networks in Discrete Time Implement Monotone-Regular Behaviors, The complexity of game isomorphism, Strengthening convex relaxations of 0/1-sets using Boolean formulas, Secret-Sharing Schemes: A Survey, How to share a secret, Any 2-asummable bipartite function is weighted threshold, Decomposing 1-Sperner hypergraphs, On the optimization of bipartite secret sharing schemes, Unnamed Item, Ideal Hierarchical Secret Sharing Schemes, Practical (fully) distributed signatures provably secure in the standard model
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Parallel computation with threshold functions
- Majority gates vs. general weighted threshold gates
- Weighted threshold secret sharing schemes
- Relating monotone formula size and monotone depth of Boolean functions
- Monotone Boolean formulas can approximate monotone linear threshold functions
- How to share a secret
- Short monotone formulae for the majority function
- On the Size of Weights for Threshold Gates
- Simulating Threshold Circuits by Majority Circuits
- Progress in Cryptology - INDOCRYPT 2003
- Mathematical Foundations of Computer Science 2005
- Theory of Cryptography
- Majority Gate Networks
