Bondy's theorem

Bondy's theorem

Bondy's theorem is a theorem in computational learning theory that appear in a 1972 article by Adrian Bondy. The theorem is as follows:

Let "C" be a concept class over a finite domain "X". Then there exists a subset "S" of "X" with the size at most |"C"| − 1 such that "S" is a witness set for every concept in "C".

This implies that every finite concept class "C" has its teaching dimension bounded by |"C"| − 1.


Wikimedia Foundation. 2010.

Игры ⚽ Нужно сделать НИР?

Look at other dictionaries:

  • Ore's theorem — For Ore s theorem in ring theory, see Ore condition. Ore s theorem is a result in graph theory proved in 1960 by Norwegian mathematician Øystein Ore. It gives a sufficient condition for a graph to be Hamiltonian, essentially stating that a graph… …   Wikipedia

  • John Adrian Bondy — Pour les articles homonymes, voir Bondy (homonymie). John Adrian Bondy, Anglais et Canadien, était professeur de théorie des graphes à l université de Waterloo, au Canada. Il est membre de l Université Lyon 1. Il a donné son nom au théorème Bondy …   Wikipédia en Français

  • König's theorem (graph theory) — In the mathematical area of graph theory, König s theorem describes an equivalence between the maximum matching problem and the minimum vertex cover problem in bipartite graphs. Setting A graph is bipartite if its vertices can be partitioned into …   Wikipedia

  • Turán's theorem — In graph theory, Turán s theorem is a result on the number of edges in a Kr+1 free graph. An n vertex graph that does not contain any (r + 1) vertex clique may be formed by partitioning the set of vertices into r parts of equal or… …   Wikipedia

  • Tutte theorem — In the mathematical discipline of graph theory the Tutte theorem, named after William Thomas Tutte, is a characterization of graphs with perfect matchings. It is a generalization of the marriage theorem and is a special case of the Tutte Berge… …   Wikipedia

  • Hamiltonian path — This article is about the overall graph theory concept of a Hamiltonian path. For the specific problem of determining whether a Hamiltonian path or cycle exists in a given graph, see Hamiltonian path problem. A Hamiltonian cycle in a dodecahedron …   Wikipedia

  • List of theorems — This is a list of theorems, by Wikipedia page. See also *list of fundamental theorems *list of lemmas *list of conjectures *list of inequalities *list of mathematical proofs *list of misnamed theorems *Existence theorem *Classification of finite… …   Wikipedia

  • List of mathematics articles (B) — NOTOC B B spline B* algebra B* search algorithm B,C,K,W system BA model Ba space Babuška Lax Milgram theorem Baby Monster group Baby step giant step Babylonian mathematics Babylonian numerals Bach tensor Bach s algorithm Bachmann–Howard ordinal… …   Wikipedia

  • List of statistics topics — Please add any Wikipedia articles related to statistics that are not already on this list.The Related changes link in the margin of this page (below search) leads to a list of the most recent changes to the articles listed below. To see the most… …   Wikipedia

  • Chvátal — Family name Pronunciation Czech pronunciation: [ˈxvaːtal] Region of origin Czech lands Language(s) of origin Czech Related names …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”