Directed monotone contact networks for threshold functions
From MaRDI portal
Publication:1327314
DOI10.1016/0020-0190(94)00037-9zbMath0807.68057OpenAlexW2020165816MaRDI QIDQ1327314
Publication date: 15 June 1994
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(94)00037-9
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Related Items (1)
Cites Work
- Lower bounds of the complexity of symmetric Boolean functions of contact- rectifier circuits
- Monotone Circuits for Connectivity Require Super-Logarithmic Depth
- Amplification and percolation (probabilistic Boolean functions)
- Reliable circuits using less reliable relays
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Directed monotone contact networks for threshold functions