Efficient learning algorithms yield circuit lower bounds
Journal of Computer and System Sciences
Testing Computability by Width Two OBDDs
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Lower bounds for testing computability by small width OBDDs
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Testing computability by width-two OBDDs
Theoretical Computer Science
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
Testing computability by width-2 OBDDs where the variable order is unknown
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
| Hi-index | 0.89 |