Exploració per tema "Circuit expressions"
Ara es mostren els items 1-2 de 2
-
Characterizing the learnability of Kolmogorov easy circuit expressions
(1996-01)
Report de recerca
Accés obertWe show that Kolmogorov easy circuit expressions can be learned with membership queries in polynomial time if and only if every NE-predicate is E-solvable. Moreover we show that the previously known algorithm, that uses ... -
Learnability of Kolmogorov-easy circuit expressions via queries
(1995-02)
Report de recerca
Accés obertCircuit expressions were introduced to provide a natural link between Computational Learning and certain aspects of Structural Complexity. Upper and lower bounds on the learnability of circuit expressions are known. We ...