SIGACT News complexity theory column 32
ACM SIGACT News
On the Practice of Branching Program Boosting
EMCL '01 Proceedings of the 12th European Conference on Machine Learning
Learning Expressions over Monoids
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Learning Unary Output Two-Tape Automata from Multiplicity and Equivalence Queries
ALT '98 Proceedings of the 9th International Conference on Algorithmic Learning Theory
An efficient query learning algorithm for ordered binary decision diagrams
Information and Computation
Learning expressions and programs over monoids
Information and Computation
Interpolation of depth-3 arithmetic circuits with two multiplication gates
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
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
An efficient query learning algorithm for ordered binary decision diagrams
Information and Computation
Learning expressions and programs over monoids
Information and Computation
An algebraic perspective on Boolean function learning
ALT'09 Proceedings of the 20th international conference on Algorithmic learning theory
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
On optimal learning algorithms for multiplicity automata
COLT'06 Proceedings of the 19th annual conference on Learning Theory
Testing computability by width-two OBDDs
Theoretical Computer Science
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.00 |