Skip to content
conftrace_

computational complexity

452 papers

Papers

Algorithms for Structured Elections Under Thiele Voting Rules AAAI 2026 Computational Complexity of Repair Problems on Simple Temporal Networks with Uncertainty UAI 2026 Computing Exact Nash Equilibria in Graphical Games: A Geometric Approach to Paths, Stars, and Caterpillars UAI 2026 Concept Sketching for Description Logics UAI 2026 Cumulant Attention in Vision Transformers (Student Abstract) AAAI 2026 Edge-Binary Public Goods Games AAAI 2026 F-INR: Functional Tensor Decomposition for Implicit Neural Representations WACV 2026 Fundamental Limits and Optimal Methods for Sharp Analytical Causal Bounds in Instrumental Variable Models UAI 2026 High-Dimensional Gaussian Mean Estimation under Realizable Contamination COLT 2026 Higher-Order Responsibility AAAI 2026 How fast can you find a good hypothesis? COLT 2026 How Hard Is It to Explain Preferences Using Few Boolean Attributes? AAAI 2026 Identifying Imperfect Clones in Elections AAAI 2026 Inapproximability of STRIPS Planning AAAI 2026 Learning DFAs from Positive Examples Only via Word Counting AAAI 2026 Model Counting for Dependency Quantified Boolean Formulas AAAI 2026 Non-Monotonic S4F Standpoint Logic AAAI 2026 NP-Hard Lower Bound Complexity for Semantic Self-Verification EACL 2026 Picking a Representative Set of Solutions in Multiobjective Optimization: Axioms, Algorithms, and Experiments AAAI 2026 Understanding the Impact of Proportionality in Approval-Based Multiwinner Elections AAAI 2026 A Computationally Efficient Algorithm for Infinite-Horizon Average-Reward Linear MDPs ICML 2025 Adaptive Manipulation for Coalitions in Knockout Tournaments AAAI 2025 A Lightweight Hybrid Dual Channel Speech Enhancement System under Low-SNR Conditions Interspeech 2025 An Improved Clique-Picking Algorithm for Counting Markov Equivalent DAGs via Super Cliques Transfer ICML 2025 Assessing the Exposure to Public Knowledge in Policy-Protected Description Logic Ontologies IJCAI 2025