Bounds for the computational power and learning complexity of analog neural nets
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
On frequent sets of Boolean matrices
Annals of Mathematics and Artificial Intelligence
The parallel complexity of deterministic and probabilistic automata
Journal of Automata, Languages and Combinatorics
Affine projections of symmetric polynomials
Journal of Computer and System Sciences - Complexity 2001
Computational complexity of neural networks: a survey
Nordic Journal of Computing
Structural Complexity and Neural Networks
WIRN VIETRI 2002 Proceedings of the 13th Italian Workshop on Neural Nets-Revised Papers
Relations Between Communication Complexity, Linear Arrangements, and Computational Complexity
FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
Using the Pseudo-Dimension to Analyze Approximation Algorithms for Integer Programming
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
New degree bounds for polynomial threshold functions
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Upper and Lower Bounds for Some Depth-3 Circuit Classes
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
On the Computational Power of Max-Min Propagation Neural Networks
Neural Processing Letters
Learning intersections and thresholds of halfspaces
Journal of Computer and System Sciences - Special issue on FOCS 2002
Threshold circuit lower bounds on cryptographic functions
Journal of Computer and System Sciences
Combinatorics, Probability and Computing
Powering requires threshold depth 3
Information Processing Letters
On the computational power of threshold circuits with sparse activity
Neural Computation
Every Linear Threshold Function has a Low-Weight Approximator
Computational Complexity
Lower bounds for the computational power of networks of spiking neurons
Neural Computation
Hardness amplification proofs require majority
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Evolvability from learning algorithms
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Learning unions of ω(1)-dimensional rectangles
Theoretical Computer Science
Theoretical Computer Science
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Guest Column: correlation bounds for polynomials over {0 1}
ACM SIGACT News
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Complexity Lower Bounds using Linear Algebra
Foundations and Trends® in Theoretical Computer Science
On the Power of Small-Depth Computation
Foundations and Trends® in Theoretical Computer Science
Energy complexity and depth of threshold circuits
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
A uniform lower bound on weights of perceptrons
CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
SIAM Journal on Computing
SIAM Journal on Computing
Hardness Amplification Proofs Require Majority
SIAM Journal on Computing
Testing (subclasses of) halfspaces
Property testing
Testing (subclasses of) halfspaces
Property testing
Lower bounds for linear decision trees via an energy complexity argument
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Bounded Independence Fools Halfspaces
SIAM Journal on Computing
Learning unions of ω(1)-dimensional rectangles
ALT'06 Proceedings of the 17th international conference on Algorithmic Learning Theory
Learning DNF by statistical and proper distance queries under the uniform distribution
ALT'05 Proceedings of the 16th international conference on Algorithmic Learning Theory
Lower bounds for circuits with few modular and symmetric gates
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Exponential lower bound for bounded depth circuits with few threshold gates
Information Processing Letters
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
Bounded-depth threshold circuits for computer-assisted CT image classification
Artificial Intelligence in Medicine
SIAM Journal on Computing
Root finding with threshold circuits
Theoretical Computer Science
Decomposition of threshold functions into bounded fan-in threshold functions
Information and Computation
| Hi-index | 0.00 |