Author of the publication

On the Power and Limitations of Branch and Cut.

, , , , , , and . CCC, volume 200 of LIPIcs, page 6:1-6:30. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)

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.

 

Other publications of authors with the same name

Boolean Function Monotonicity Testing Requires (Almost) n1/2 Non-adaptive Queries., , , and . STOC, page 519-528. ACM, (2015)Fooling polytopes., , and . STOC, page 614-625. ACM, (2019)On the Distribution of the Fourier Spectrum of Halfspaces, , , , and . (2012)cite arxiv:1202.6680.Harnessing the Power of Choices in Decision Tree Learning., , , , , and . CoRR, (2023)Approximating Boolean Functions with Depth-2 Circuits., and . CCC, page 74-85. IEEE Computer Society, (2013)Fooling Gaussian PTFs via local hyperconcentration., , and . STOC, page 1170-1183. ACM, (2020)Fooling Intersections of Low-Weight Halfspaces., and . FOCS, page 824-835. IEEE Computer Society, (2017)A query-optimal algorithm for finding counterfactuals., , , and . ICML, volume 162 of Proceedings of Machine Learning Research, page 2075-2090. PMLR, (2022)Properly learning decision trees with queries is NP-hard., , and . FOCS, page 2383-2407. IEEE, (2023)Decision Tree Heuristics Can Fail, Even in the Smoothed Setting., , , and . APPROX-RANDOM, volume 207 of LIPIcs, page 45:1-45:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)