conftrace_

exponential time hypothesis

8 papers

Explore in graph

Also known as

ETH

Co-occurring keywords · papers mentioning both

fine-grained complexity (2) outside computation (1) propositional abduction (1) graph class (1) positive cycle (1) non-clashing teaching map (1) non-clashing teaching dimension (1) kernelization algorithm (1) statistical threshold (1) separation condition (1)

Papers

A Fine-Grained Complexity View on Propositional Abduction - Algorithms and Lower Bounds IJCAI 2025 Learning Augmented Graph k-Clustering COLT 2025 Quantum Speedups for Bayesian Network Structure Learning UAI 2025 Near-Optimal Learning and Planning in Separated Latent MDPs COLT 2024 Non-Clashing Teaching Maps for Balls in Graphs COLT 2024 Outside Computation with Superior Functions NAACL 2021 Treewidth-Aware Complexity in ASP: Not all Positive Cycles are Equally Hard AAAI 2021 Lower Bounds and Faster Algorithms for Equality Constraints IJCAI 2020