Journal of the ACM (JACM)
Identification criteria and lower bounds for perceptron-like learning rules
Neural Computation
On PAC learning using Winnow, Perceptron, and a Perceptron-like algorithm
COLT '99 Proceedings of the twelfth annual conference on Computational learning theory
A Constructive Approach to Calculating Lower Entropy Bounds
Neural Processing Letters
Computing with continuous-time Liapunov systems
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Minds and Machines
Computational complexity of neural networks: a survey
Nordic Journal of Computing
Continuous-time symmetric Hopfield nets are computationally universal
Neural Computation
On the Computational Complexity of Binary and Analog Symmetric Hopfield Nets
Neural Computation
On the computational power of threshold circuits with sparse activity
Neural Computation
Binary Decision Diagrams and neural networks
The Journal of Supercomputing
The computational power of discrete hopfield nets with hidden units
Neural Computation
Boolean function complexity and neural networks
NN'06 Proceedings of the 7th WSEAS International Conference on Neural Networks
Theoretical Computer Science
Investigating data preprocessing methods for circuit complexity models
Expert Systems with Applications: An International Journal
Sequential triangle strip generator based on hopfield networks
Neural Computation
On the complexity of hierarchical associative memories
Proceedings of the 2009 ACM symposium on Applied Computing
Prediction of area and length complexity measures for binary decision diagrams
Expert Systems with Applications: An International Journal
Constructive threshold logic addition: a synopsis of the last decade
ICANN/ICONIP'03 Proceedings of the 2003 joint international conference on Artificial neural networks and neural information processing
Energy complexity and depth of threshold circuits
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
Energy and depth of threshold circuits
Theoretical Computer Science
Algorithms and theory of computation handbook
Weights of exact threshold functions
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Size-energy tradeoffs for unate circuits computing symmetric Boolean functions
Theoretical Computer Science
A better upper bound on weights of exact threshold functions
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
On exact learning halfspaces with random consistent hypothesis oracle
ALT'06 Proceedings of the 17th international conference on Algorithmic Learning Theory
Energy complexity and entropy of threshold circuits
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
On the complexity of depth-2 circuits with threshold gates
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Lower bound on weights of large degree threshold functions
CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
Energy-efficient threshold circuits computing mod functions
CATS 2011 Proceedings of the Seventeenth Computing on The Australasian Theory Symposium - Volume 119
Complexity of counting output patterns of logic circuits
CATS '13 Proceedings of the Nineteenth Computing: The Australasian Theory Symposium - Volume 141
| Hi-index | 0.01 |