Carmen Daniela Strassle

All Publications

• Computational-Statistical Tradeoffs from NP-hardness Blanc, G., Koch, C., Strassle, C., Tan, L., IEEE COMPUTER SOC IEEE COMPUTER SOC. 2025: 512-530

  View details for DOI 10.1109/FOCS63196.2025.00028

  View details for Web of Science ID 001711633100022

• A Distributional-Lifting Theorem for PAC Learning Blanc, G., Lange, J., Strassle, C., Tan, L. edited by Haghtalab, N., Moitra, A. JMLR-JOURNAL MACHINE LEARNING RESEARCH. 2025

  View details for Web of Science ID 001592918200015

• Fast decision tree learning solves hard coding-theoretic problems Koch, C., Strassle, C., Tan, L., IEEE COMPUTER SOC IEEE COMPUTER SOC. 2024: 1893-1910

  View details for DOI 10.1109/FOCS61266.2024.00114

  View details for Web of Science ID 001419526400105

• A Strong Direct Sum Theorem for Distributional Query Complexity Blanc, G., Koch, C., Strassle, C., Tan, L. edited by Santhanam, R. SCHLOSS DAGSTUHL, LEIBNIZ CENTER INFORMATICS. 2024

  View details for DOI 10.4230/LIPIcs.CCC.2024.16

  View details for Web of Science ID 001589524300016

• A strong composition theorem for junta complexity and the boosting of property testers Blanc, G., Koch, C., Strassle, C., Tan, L., IEEE IEEE COMPUTER SOC. 2023: 1757-1777

  View details for DOI 10.1109/FOCS57990.2023.00107

  View details for Web of Science ID 001137125900101

• Properly learning decision trees with queries is NP-hard Koch, C., Strassle, C., Tan, L., IEEE IEEE COMPUTER SOC. 2023: 2383-2407

  View details for DOI 10.1109/FOCS57990.2023.00146

  View details for Web of Science ID 001137125900140

• Superpolynomial lower bounds for decision tree learning and testing Koch, C., Strassle, C., Tan, L. edited by Bansal, N., Nagarajan SIAM. 2023: 1962-1994

  View details for Web of Science ID 001288501200162