Communications of the ACM
Learning regular sets from queries and counterexamples
Information and Computation
Finite monoids and the fine structure of NC1
Journal of the ACM (JACM)
Bounded-width polynomial-size branching programs recognize exactly those languages in NC1
Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
Programs over aperiodic monoids
Theoretical Computer Science
Learning decision trees from random examples needed for learning
Information and Computation
Non-uniform automata over groups
Information and Computation
Rank-r decision trees are a subclass of r-decision lists
Information Processing Letters
The membership problem in aperiodic transformation monoids
Journal of the ACM (JACM)
Journal of Computer and System Sciences - Special issue: papers from the 22nd ACM symposium on the theory of computing, May 14–16, 1990
An introduction to computational learning theory
An introduction to computational learning theory
Fast learning of k-term DNF formulas with queries
Journal of Computer and System Sciences - Special issue on selected papers presented at the 24th annual ACM symposium on the theory of computing (STOC '92)
Exact learning Boolean functions via the monotone theory
Information and Computation
An efficient membership-query algorithm for learning DNF with respect to the uniform distribution
Journal of Computer and System Sciences
Programs over semigroups of dot-depth one
Theoretical Computer Science
Automata, Languages, and Machines
Automata, Languages, and Machines
Machine Learning
Machine Learning
Machine Learning
An Algebraic Approach to Communication Complexity
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Learning decision lists and trees with equivalence-queries
EuroCOLT '95 Proceedings of the Second European Conference on Computational Learning Theory
Simple PAC Learning of Simple Decision Lists
ALT '95 Proceedings of the 6th International Conference on Algorithmic Learning Theory
The Biases of Decision Tree Pruning Strategies
IDA '99 Proceedings of the Third International Symposium on Advances in Intelligent Data Analysis
Learning expressions and programs over monoids
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
An algebraic point of view on the crane beach property
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Regular languages, unambiguous concatenation and computational complexity
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
An algebraic view on exact learning from queries
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
(Nearly-)tight bounds on the contiguity and linearity of cographs
Theoretical Computer Science
| Hi-index | 0.00 |
Programs over semigroups are a well-studied model of computation for boolean functions. It has been used successfully to characterize, in algebraic terms, classes of problems that can, or cannot, be solved within certain resources. The interest of the approach is that the algebraic complexity of the semigroups required to capture a class should be a good indication of its expressive (or computing) power.In this paper we derive algebraic characterizations for some "small" classes of boolean functions, all of which have depth-3 AC掳 circuits, namely k-term DNF, k-DNF, k-decision lists, decision trees of bounded rank, and DNF. The interest of such classes, and the reason for this investigation, is that they have been intensely studied in computational learning theory.