scientific article; zbMATH DE number 761425
From MaRDI portal
Publication:4835643
zbMATH Open0838.68034MaRDI QIDQ4835643FDOQ4835643
T. Kailath, Vwani Roychowdhury, Kai-Yeung Siu
Publication date: 7 June 1995
Title of this publication is not available (Why is that?)
Recommendations
Learning and adaptive systems in artificial intelligence (68T05) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)
Cited In (19)
- Minimal Sign Representation of Boolean Functions: Algorithms and Exact Results for Low Dimensions
- Energy and depth of threshold circuits
- On the enumeration of Boolean functions with distinguished variables
- Size-energy tradeoffs for unate circuits computing symmetric Boolean functions
- Quadratization of symmetric pseudo-Boolean functions
- Neural computation: A research topic for theoretical computer science? Some thoughts and pointers
- Size, Depth and Energy of Threshold Circuits Computing Parity Function.
- Exponential lower bounds on the size of constant-depth threshold circuits with small energy complexity
- Title not available (Why is that?)
- Sign-representation of Boolean functions using a small number of monomials
- Efficient Associative Computation with Discrete Synapses
- On the characterization of weighted simple games
- Qualitative analysis of discrete competitive-cooperative neural networks
- Combined weight and density bounds on the polynomial threshold function representation of Boolean functions
- Spiking neurons and the induction of finite state machines.
- Computing with Spikes: The Advantage of Fine-Grained Timing
- Size and Energy of Threshold Circuits Computing Mod Functions
- Improved approximation of linear threshold functions
- Title not available (Why is that?)
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)
