( en | de | ru )

 

Disambiguation of "Hellerstein, Lisa"

Author of the publication

copydeleteadd this publication to your clipboard
Read-Thrice DNF Is Hard to Learn With Membership and Equivalence Queries

, , and . FOCS, page 523-532. IEEE Computer Society, (1992)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Gaëlle Lisack

Oleg Lisagor

Hamel Lisa

Jacob Lisakafu

Tautvydas Lisauskas

 

Other publications of authors with the same name

Conjunctions of Unate DNF Formulas: Learning and Structure., and . Inf. Comput., 140 (2): 203-228 (1998)Adaptivity Gaps for the Stochastic Boolean Function Evaluation Problem., , , and . WAOA, volume 13538 of Lecture Notes in Computer Science, page 190-210. Springer, (2022)Evaluation of DNF Formulas., , , and . ISAIM, (2014)Minimizing DNF Formulas and AC0d Circuits Given a Truth Table., , , , and . CCC, page 237-251. IEEE Computer Society, (2006)Solving Zero-Sum Games Using Best-Response Oracles with Applications to Search Games., , and . Operations Research, 67 (3): 731-743 (2019)Complexity Theoretic Hardness Results for Query Learning., , , and . Comput. Complex., 7 (1): 19-53 (1998)Revisiting the Approximation Bound for Stochastic Submodular Cover., and . J. Artif. Intell. Res., (2018)Exact learning of DNF formulas using DNF hypotheses., and . STOC, page 465-473. ACM, (2002)Why skewing works: learning difficult Boolean functions with greedy tree learners., , , and . ICML, volume 119 of ACM International Conference Proceeding Series, page 728-735. ACM, (2005)Tight Bounds on Proper Equivalence Query Learning of DNF., , , and . COLT, volume 23 of JMLR Proceedings, page 31.1-31.18. JMLR.org, (2012)