:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Fioravantes, Foivos, Knop, Dušan, Křišťan, Jan Matyáš, Melissinos, Nikolaos, Opler, Michal
Format:	Preprint
Published:	2024
Subjects:	Computational Complexity Artificial Intelligence
Online Access:	https://arxiv.org/abs/2412.08556
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Solving Multiagent Path Finding on Highly Centralized Networks
by: Fioravantes, Foivos, et al.
Published: (2024)

When Agents Break Down in Multiagent Path Finding
by: Fioravantes, Foivos, et al.
Published: (2025)

Exact Algorithms for Distance to Unique Vertex Cover
by: Fioravantes, Foivos, et al.
Published: (2025)

Parameterised distance to local irregularity
by: Fioravantes, Foivos, et al.
Published: (2023)

Exact Algorithms and Lower Bounds for Forming Coalitions of Constrained Maximum Size
by: Fioravantes, Foivos, et al.
Published: (2025)

Parameterized Critical Node Cut Revisited
by: Knop, Dušan, et al.
Published: (2025)

Exact Algorithms for Resource Reallocation Under Budgetary Constraints
by: Das, Arun Kumar, et al.
Published: (2025)

On the Complexity of Target Set Selection in Simple Geometric Networks
by: Dvořák, Michal, et al.
Published: (2023)

Individual Rationality in Constrained Hedonic Games: Additively Separable and Fractional Preferences
by: Fioravantes, Foivos, et al.
Published: (2026)

Game-Theoretic and Algorithmic Analyses of Multi-Agent Routing under Crossing Costs
by: Hanaka, Tesshu, et al.
Published: (2026)

Multi-Agent Path Finding For Large Agents Is Intractable
by: Agafonov, Artem, et al.
Published: (2025)

Graph Irregularity via Edge Deletions
by: Bensmail, Julien, et al.
Published: (2025)

Fast and simple multiplication of bounded twin-width matrices
by: Kozma, László, et al.
Published: (2026)

Parameterized Max Min Feedback Vertex Set
by: Lampis, Michael, et al.
Published: (2023)

Mathematical Algorithm Design for Deep Learning under Societal and Judicial Constraints: The Algorithmic Transparency Requirement
by: Boche, Holger, et al.
Published: (2024)

CSPs with Few Alien Constraints
by: Jonsson, Peter, et al.
Published: (2024)

Eliminating Majority Illusions
by: Fioravantes, Foivos, et al.
Published: (2025)

Structural Parameters for Steiner Orientation
by: Hanaka, Tesshu, et al.
Published: (2025)

ActionReasoningBench: Reasoning about Actions with and without Ramification Constraints
by: Handa, Divij, et al.
Published: (2024)

Fast Approximation Algorithm for Non-Monotone DR-submodular Maximization under Size Constraint
by: Tran, Tan D., et al.
Published: (2025)

Expected Shapley-Like Scores of Boolean Functions: Complexity and Applications to Probabilistic Databases
by: Karmakar, Pratik, et al.
Published: (2024)

Precoloring extension with demands on paths
by: Das, Arun Kumar, et al.
Published: (2025)

Satisfactory Budget Division
by: Gourvès, Laurent, et al.
Published: (2025)

Social Distancing Induced Coronavirus Optimization Algorithm (COVO): Application to Multimodal Function Optimization and Noise Removal
by: Varma, Om Ramakisan, et al.
Published: (2024)

Data Complexity in Expressive Description Logics With Path Expressions
by: Bednarczyk, Bartosz
Published: (2024)

On the Complexity of Identification in Linear Structural Causal Models
by: Dörfler, Julian, et al.
Published: (2024)

Learning to Think from Multiple Thinkers
by: Joshi, Nirmit, et al.
Published: (2026)

Structure-Aware Encodings of Argumentation Properties for Clique-width
by: Mahmood, Yasir, et al.
Published: (2025)

A Structural Complexity Analysis of Hierarchical Task Network Planning
by: Brand, Cornelius, et al.
Published: (2024)

FormulaOne: Measuring the Depth of Algorithmic Reasoning Beyond Competitive Programming
by: Beniamini, Gal, et al.
Published: (2025)

Bandwidth Parameterized by Cluster Vertex Deletion Number
by: Gima, Tatsuya, et al.
Published: (2023)

Reinforced Generation of Combinatorial Structures: Ramsey Numbers
by: Nagda, Ansh, et al.
Published: (2026)

Simplified Algorithmic Metatheorems Beyond MSO: Treewidth and Neighborhood Diversity
by: Knop, Dušan, et al.
Published: (2017)

Theoretical Constraints on the Expressive Power of $\mathsf{RoPE}$-based Tensor Attention Transformers
by: Li, Xiaoyu, et al.
Published: (2024)

Neural Algorithmic Reasoning for Hypergraphs with Looped Transformers
by: Huang, Zekai, et al.
Published: (2025)

Simulating Weighted Automata over Sequences and Trees with Transformers
by: Rizvi, Michael, et al.
Published: (2024)

Kidney Exchange: Faster Parameterized Algorithms and Tighter Lower Bounds
by: Banik, Aritra, et al.
Published: (2025)

A Fine-Grained Complexity View on Propositional Abduction -- Algorithms and Lower Bounds
by: Lagerkvist, Victor, et al.
Published: (2025)

Finding hardness reductions automatically using SAT solvers
by: Bergold, Helena, et al.
Published: (2024)

Strongly Polynomial Time Complexity of Policy Iteration for $L_\infty$ Robust MDPs
by: Asadi, Ali, et al.
Published: (2026)