Carmen Strassle

21 papers A* 7A 3Journal 11
YearRankTypeTitle / Venue / Authors
2026 A conf
Samplability Makes Learning Easier.
ITCS
Guy Blanc, Caleb Koch, Jane Lange, Carmen Strassle, Li-Yang Tan
2025 A* conf
A Distributional-Lifting Theorem for PAC Learning.
COLT
Guy Blanc, Jane Lange, Carmen Strassle, Li-Yang Tan
2025 J jnl
A Distributional-Lifting Theorem for PAC Learning.
CoRR
Guy Blanc, Jane Lange, Carmen Strassle, Li-Yang Tan
2025 A* conf
Computational-Statistical Tradeoffs from NP-hardness.
FOCS
Guy Blanc, Caleb Koch, Carmen Strassle, Li-Yang Tan
2025 J jnl
Computational-Statistical Tradeoffs from NP-hardness.
CoRR
Guy Blanc, Caleb Koch, Carmen Strassle, Li-Yang Tan
2025 J jnl
Samplability makes learning easier.
CoRR
Guy Blanc, Caleb Koch, Jane Lange, Carmen Strassle, Li-Yang Tan
2025 J jnl
The power of quantum circuits in sampling.
CoRR
Guy Blanc, Caleb Koch, Jane Lange, Carmen Strassle, Li-Yang Tan
2024 A conf
A Strong Direct Sum Theorem for Distributional Query Complexity.
CCC
Guy Blanc, Caleb Koch, Carmen Strassle, Li-Yang Tan
2024 J jnl
A Strong Direct Sum Theorem for Distributional Query Complexity.
CoRR
Guy Blanc, Caleb Koch, Carmen Strassle, Li-Yang Tan
2024 A* conf
Fast Decision Tree Learning Solves Hard Coding-Theoretic Problems.
FOCS
Caleb Koch, Carmen Strassle, Li-Yang Tan
2024 J jnl
Fast decision tree learning solves hard coding-theoretic problems.
CoRR
Caleb Koch, Carmen Strassle, Li-Yang Tan
2024 A* conf
Superconstant Inapproximability of Decision Tree Learning.
COLT
Caleb Koch, Carmen Strassle, Li-Yang Tan
2024 J jnl
Superconstant Inapproximability of Decision Tree Learning.
CoRR
Caleb Koch, Carmen Strassle, Li-Yang Tan
2023 J jnl
A Strong Composition Theorem for Junta Complexity and the Boosting of Property Testers.
CoRR
Guy Blanc, Caleb Koch, Carmen Strassle, Li-Yang Tan
2023 A* conf
A strong composition theorem for junta complexity and the boosting of property testers.
FOCS
Guy Blanc, Caleb Koch, Carmen Strassle, Li-Yang Tan
2023 A conf
Certification with an NP Oracle.
ITCS
Guy Blanc, Caleb Koch, Jane Lange, Carmen Strassle, Li-Yang Tan
2023 J jnl
Properly Learning Decision Trees with Queries Is NP-Hard.
CoRR
Caleb Koch, Carmen Strassle, Li-Yang Tan
2023 A* conf
Properly learning decision trees with queries is NP-hard.
FOCS
Caleb Koch, Carmen Strassle, Li-Yang Tan
2023 A* conf
Superpolynomial lower bounds for decision tree learning and testing.
SODA
Caleb Koch, Carmen Strassle, Li-Yang Tan
2022 J jnl
Certification with an NP Oracle.
CoRR
Guy Blanc, Caleb Koch, Jane Lange, Carmen Strassle, Li-Yang Tan
2022 J jnl
Superpolynomial Lower Bounds for Decision Tree Learning and Testing.
CoRR
Caleb Koch, Carmen Strassle, Li-Yang Tan