Loading jsMath...
Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > AUTHORS > RYUHEI UEHARA:
All reports by Author Ryuhei Uehara:

TR96-061 | 27th November 1996
Ryuhei Uehara, Kensei Tsuchida, Ingo Wegener

Optimal attribute-efficient learning of disjunction, parity, and threshold functions

Decision trees are a very general computation model.
Here the problem is to identify a Boolean function f out of a given
set of Boolean functions F by asking for the value of f at adaptively
chosen inputs.
For classes F consisting of functions which may be obtained from one
more >>>




ISSN 1433-8092 | Imprint