אירועים והרצאות בפקולטה למדעי המחשב ע"ש הנרי ומרילין טאוב

We give a new deterministic algorithm that non-adaptively learn a hidden hypergraph from edge-detecting query. This algorithm use a very interesting algebraic families: Perfect Hash, Universal Set and Cover Free family. All previous non-adaptive algorithms either run in exponential time or have non optimal query complexity. We give the first polynomial time non-adaptive learning algorithm for learning hypergraph that asks an almost optimal number of queries.