Impatient Learning and sub/sup Majority Problem
In this article I present some probabilities of 1-step learning optimized by Impatient Learning (http://www.citebase.org/abstract?id=oai:arXiv.org:quant-ph/0309059) for the sub/sup Majority Learning.
The (Sub/Sup) Majority Learning
Take a bitstring a, and an integer . The oracle will respond 0 if if queried with x and 1 otherwise. In other terms this oracle reply yes if two bitstrings agree [...]













