:: Library Catalog

Cover Image

Saved in:

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

Similar Items

Exact Algorithms for Multiagent Path Finding with Communication Constraints on Tree-Like Structures
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)

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

Exact Algorithms and Lower Bounds for Forming Coalitions of Constrained Maximum Size
by: Fioravantes, Foivos, 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)

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)

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

Solving Quantified Boolean Formulas with Few Existential Variables
by: Eriksson, Leif, et al.
Published: (2024)

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

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

Modern Hopfield Networks Require Chain-of-Thought to Solve $\mathsf{NC}^1$-Hard Problems
by: Cao, Yang, et al.
Published: (2024)

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

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

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

Solving Satisfiability Modulo Counting for Symbolic and Statistical AI Integration With Provable Guarantees
by: Li, Jinzhao, et al.
Published: (2023)

When Can We Solve the Weighted Low Rank Approximation Problem in Truly Subquadratic Time?
by: Li, Chenyang, et al.
Published: (2025)

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

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

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

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

On the Computational Capability of Graph Neural Networks: A Circuit Complexity Bound Perspective
by: Li, Xiaoyu, et al.
Published: (2025)

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

Clausal Deletion Backdoors for QBF: a Parameterized Complexity Approach
by: Eriksson, Leif, et al.
Published: (2026)

Over the Edge of Chaos? Excess Complexity as a Roadblock to Artificial General Intelligence
by: Susnjak, Teo, et al.
Published: (2024)

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

Prime Successor Irreducibility: Turing Machine Complexity, Kolmogorov Complexity, and Weakness-Based Formulations
by: Goertzel, Ben, et al.
Published: (2026)

Probabilistic Generating Circuits -- Demystified
by: Agarwal, Sanyam, et al.
Published: (2024)

The Computational Boundary of Inference: Capability Internalization, Training, and the Turing Jump
by: Lu, Chien-Ping
Published: (2026)

From Probability to Counterfactuals: the Increasing Complexity of Satisfiability in Pearl's Causal Hierarchy
by: Dörfler, Julian, et al.
Published: (2024)

Parameterized Complexity Of Representing Models Of MSO Formulas
by: Kučera, Petr, et al.
Published: (2026)

An extended Knowledge Compilation Map for Conditional Preference Statements-based and Generalized Additive Utilities-based Languages
by: Fargier, Hélène, et al.
Published: (2021)

Complexity of Scheduling Charging in the Smart Grid
by: de Weerdt, Mathijs, et al.
Published: (2017)

Diversity of Extensions in Abstract Argumentation
by: Fichte, Johannes K., et al.
Published: (2026)

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