On the Minimal Hardware Complexity of Pseudorandom Function Generators
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
On the Computational Power of Boolean Decision Lists
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
New degree bounds for polynomial threshold functions
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
On the computational power of Boolean decision lists
Computational Complexity
Toward Attribute Efficient Learning of Decision Lists and Parities
The Journal of Machine Learning Research
Separating AC0 from depth-2 majority circuits
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Learning unions of ω(1)-dimensional rectangles
Theoretical Computer Science
Optimal bounds for sign-representing the intersection of two halfspaces by polynomials
Proceedings of the forty-second ACM symposium on Theory of computing
Learning unions of ω(1)-dimensional rectangles
ALT'06 Proceedings of the 17th international conference on Algorithmic Learning Theory
On PAC learning algorithms for rich boolean function classes
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
On the complexity of depth-2 circuits with threshold gates
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Making polynomials robust to noise
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
SIAM Journal on Computing
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
| Hi-index | 0.00 |