Sciweavers

2743 search results - page 7 / 549
» Minimization of an M-convex Function
Sort
View
55
Voted
INFORMS
2002
56views more  INFORMS 2002»
14 years 9 months ago
Minimizing the Average Query Complexity of Learning Monotone Boolean Functions
Vetle I. Torvik, Evangelos Triantaphyllou
ISMVL
2009
IEEE
88views Hardware» more  ISMVL 2009»
15 years 4 months ago
Minimal Coverings of Maximal Partial Clones
A partial function f on an k-element set Ek is a partial Sheffer function if every partial function on Ek is definable in terms of f. Since this holds if and only if f belongs to...
Karsten Schölzel