An Algebraic Perspective on Boolean Function Learning
From MaRDI portal
Publication:3648753
DOI10.1007/978-3-642-04414-4_19zbMath1262.68066OpenAlexW1801945342MaRDI QIDQ3648753
Publication date: 1 December 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-04414-4_19
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (3)
Exact learning from an honest teacher that answers membership queries ⋮ Learning Read-Constant Polynomials of Constant Degree Modulo Composites ⋮ Learning read-constant polynomials of constant degree modulo composites
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Non-uniform automata over groups
- Learning regular sets from queries and counterexamples
- Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
- Sur le produit de concatenation non ambigu
- On ACC
- A simple algorithm for learning O(log n)-term DNF
- Complete classifications for the communication complexity of regular languages
- Learning decision trees from random examples
- On PAC learning algorithms for rich Boolean function classes
- Learning expressions and programs over monoids
- Languages with Bounded Multiparty Communication Complexity
- Representation theory of finite semigroups, semigroup radicals and formal language theory
- A theory of the learnable
- Learning functions represented as multiplicity automata
- MONOIDS AND COMPUTATIONS
- The pseudovariety of semigroups of triangular matrices over a finite field
- Learning Behaviors of Automata from Multiplicity and Equivalence Queries
This page was built for publication: An Algebraic Perspective on Boolean Function Learning
