scientific article; zbMATH DE number 761425
From MaRDI portal
Publication:4835643
Recommendations
Cited in
(19)- Neural computation: A research topic for theoretical computer science? Some thoughts and pointers
- Combined weight and density bounds on the polynomial threshold function representation of Boolean functions
- Exponential lower bounds on the size of constant-depth threshold circuits with small energy complexity
- Qualitative analysis of discrete competitive-cooperative neural networks
- Minimal sign representation of Boolean functions: algorithms and exact results for low dimensions
- Sign-representation of Boolean functions using a small number of monomials
- Energy and depth of threshold circuits
- Efficient Associative Computation with Discrete Synapses
- Spiking neurons and the induction of finite state machines.
- Size and Energy of Threshold Circuits Computing Mod Functions
- Improved approximation of linear threshold functions
- On the enumeration of Boolean functions with distinguished variables
- scientific article; zbMATH DE number 19763 (Why is no real title available?)
- Size-energy tradeoffs for unate circuits computing symmetric Boolean functions
- On the characterization of weighted simple games
- Quadratization of symmetric pseudo-Boolean functions
- Size, Depth and Energy of Threshold Circuits Computing Parity Function.
- Computing with spikes: the advantage of fine-grained timing
- scientific article; zbMATH DE number 1274293 (Why is no real title available?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4835643)
