polynomial time

The Expressive Power of Transformers with Chain of Thought ICLR 2024 Towards Optimal Subsidy Bounds for Envy-Freeable Allocations AAAI 2024 Computing Abductive Explanations for Boosted Trees AISTATS 2023 Contrastive Moments: Unsupervised Halfspace Learning in Polynomial Time NeurIPS 2023 Detection-Recovery and Detection-Refutation Gaps via Reductions from Planted Clique COLT 2023 On Total-Order HTN Plan Verification with Method Preconditions – An Extension of the CYK Parsing Algorithm AAAI 2023 Recognizing Rigid Patterns of Unlabeled Point Clouds by Complete and Continuous Isometry Invariants With No False Negatives and No False Positives CVPR 2023 Zero-Knowledge Proofs for Classical Planning Problems AAAI 2023 A Private and Computationally-Efficient Estimator for Unbounded Gaussians COLT 2022 Frontiers and Exact Learning of ELI Queries under DL-Lite Ontologies IJCAI 2022 Learning a Single Neuron for Non-monotonic Activation Functions AISTATS 2022 Linear tree shap NeurIPS 2022 Open Problem: Properly learning decision trees in polynomial time? COLT 2022 Reforming an Envy-Free Matching AAAI 2022 Self-Organized Polynomial-Time Coordination Graphs ICML 2022 Teaching LTLf Satisfiability Checking to Neural Networks IJCAI 2022 Theoretically Provable Spiking Neural Networks NeurIPS 2022 Tractable Explanations for d-DNNF Classifiers AAAI 2022 Asymptotically Optimal Strategies For Combinatorial Semi-Bandits in Polynomial Time ALT 2021 Efficient PAC Reinforcement Learning in Regular Decision Processes IJCAI 2021 Explanations for Monotonic Classifiers. ICML 2021 Faster and Better Simple Temporal Problems AAAI 2021 Polynomial-Time in PDDL Input Size: Making the Delete Relaxation Feasible for Lifted Planning IJCAI 2021 PROPm Allocations of Indivisible Goods to Multiple Agents IJCAI 2021 Revealing Hidden Preconditions and Effects of Compound HTN Planning Tasks – A Complexity Analysis AAAI 2021