Homin K. Lee

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Submodular functions are noise stable	2019-05-10	Paper
Efficiently testing sparse \(\text{GF}(2)\) polynomials Algorithmica	2011-11-07	Paper
scientific article; zbMATH DE number 5957428 (Why is no real title available?)	2011-10-12	Paper
Optimal cryptographic hardness of learning monotone functions Theory of Computing	2011-05-24	Paper
Decision trees and influence: an inductive proof of the OSSS inequality Theory of Computing	2011-05-24	Paper
Learning random monotone DNF Discrete Applied Mathematics	2011-03-10	Paper
DNF are teachable in the average case Machine Learning	2009-03-31	Paper
Learning Random Monotone DNF Lecture Notes in Computer Science	2008-11-27	Paper
Efficiently Testing Sparse GF(2) Polynomials Automata, Languages and Programming	2008-08-28	Paper
Optimal Cryptographic Hardness of Learning Monotone Functions Automata, Languages and Programming	2008-08-28	Paper
DNF Are Teachable in the Average Case Learning Theory	2007-09-14	Paper
Learning Theory Lecture Notes in Computer Science	2006-06-22	Paper

Research outcomes over time

This page was built for person: Homin K. Lee