On learning width two branching programs (Q293246): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Queries and concept learning / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: When won't membership queries help? / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\) / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Occam's razor / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Bounds for Width Two Branching Programs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A theory of the learnable / rank | |||
Normal rank |
Latest revision as of 03:37, 12 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On learning width two branching programs |
scientific article |
Statements
On learning width two branching programs (English)
0 references
9 June 2016
0 references
branching program
0 references
PAC learning
0 references
0 references