computational complexity

Balancing Efficiency and Expressiveness: Subgraph GNNs with Walk-Based Centrality ICML 2025 BSDB-Net: Band-Split Dual-Branch Network with Selective State Spaces Mechanism for Monaural Speech Enhancement AAAI 2025 Building Vision Models upon Heat Conduction CVPR 2025 CARE Transformer: Mobile-Friendly Linear Visual Transformer via Decoupled Dual Interaction CVPR 2025 Complexity Experts are Task-Discriminative Learners for Any Image Restoration CVPR 2025 Computational Complexity of Planning for Recursive Primitive Task Networks: Selective Action Nullification with State Preservation IJCAI 2025 Computationally Hard Problems Are Hard for QBF Proof Systems Too AAAI 2025 Conv-Basis: A New Paradigm for Efficient Attention Inference and Gradient Computation in Transformers EMNLP 2025 D-Attn: Decomposed Attention for Large Vision-and-Language Model ICCV 2025 Divide and Orthogonalize: Efficient Continual Learning with Local Model Space Projection UAI 2025 Efficient Curvature-Aware Hypergradient Approximation for Bilevel Optimization ICML 2025 Efficient Time Series Processing for Transformers and State-Space Models through Token Merging ICML 2025 Even-if Explanations: Formal Foundations, Priorities and Complexity AAAI 2025 Exact Algorithms and Lower Bounds for Forming Coalitions of Constrained Maximum Size AAAI 2025 Exploring the Limitations of Mamba in COPY and CoT Reasoning EMNLP 2025 Facets in Argumentation: A Formal Approach to Argument Significance IJCAI 2025 Fair and Efficient Completion of Indivisible Goods AAAI 2025 Featured Argumentation Framework: Semantics and Complexity IJCAI 2025 Finding Possible Winners in Spatial Voting with Incomplete Information IJCAI 2025 From Probability to Counterfactuals: the Increasing Complexity of Satisfiability in Pearl's Causal Hierarchy ICLR 2025 Fundamental Limits of Prompt Tuning Transformers: Universality, Capacity and Efficiency ICLR 2025 How to Resolve Envy by Adding Goods IJCAI 2025 HSI: A Holistic Style Injector for Arbitrary Style Transfer CVPR 2025 Inapproximability of Optimal Multi-Agent Pathfinding Problems AAAI 2025 Initial Models and Serialisability in Abstract Dialectical Frameworks IJCAI 2025