Image de couverture de livre

The Complexity of Symmetry Breaking Beyond Lex-Leader

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Anders, Markus, Brenner, Sofia, Rattan, Gaurav
Format:	Preprint
Publié:	2024
Sujets:	Artificial Intelligence Computational Complexity
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

satsuma: Structure-based Symmetry Breaking in SAT
par: Anders, Markus, et autres
Publié: (2024)

On the Complexity of Identification in Linear Structural Causal Models
par: Dörfler, Julian, et autres
Publié: (2024)

From Probability to Counterfactuals: the Increasing Complexity of Satisfiability in Pearl's Causal Hierarchy
par: Dörfler, Julian, et autres
Publié: (2024)

Probabilistic Generating Circuits -- Demystified
par: Agarwal, Sanyam, et autres
Publié: (2024)

Complexity Results of Persuasion
par: Grastien, Alban
Publié: (2025)

Epistemic Logic Programs: Non-Ground and Counting Complexity
par: Eiter, Thomas, et autres
Publié: (2025)

Prime Successor Irreducibility: Turing Machine Complexity, Kolmogorov Complexity, and Weakness-Based Formulations
par: Goertzel, Ben, et autres
Publié: (2026)

Complexity of Scheduling Charging in the Smart Grid
par: de Weerdt, Mathijs, et autres
Publié: (2017)

Parameterized Complexity Of Representing Models Of MSO Formulas
par: Kučera, Petr, et autres
Publié: (2026)

A Structural Complexity Analysis of Hierarchical Task Network Planning
par: Brand, Cornelius, et autres
Publié: (2024)

Explaining Decisions in ML Models: a Parameterized Complexity Analysis
par: Ordyniak, Sebastian, et autres
Publié: (2024)

Clausal Deletion Backdoors for QBF: a Parameterized Complexity Approach
par: Eriksson, Leif, et autres
Publié: (2026)

Barriers to Complexity-Theoretic Proofs that "AGI" Using Machine Learning is Impossible
par: Guerzhoy, Michael
Publié: (2024)

Diversity of Extensions in Abstract Argumentation
par: Fichte, Johannes K., et autres
Publié: (2026)

Structure-Aware Encodings of Argumentation Properties for Clique-width
par: Mahmood, Yasir, et autres
Publié: (2025)

Over the Edge of Chaos? Excess Complexity as a Roadblock to Artificial General Intelligence
par: Susnjak, Teo, et autres
Publié: (2024)

Strongly Polynomial Time Complexity of Policy Iteration for $L_\infty$ Robust MDPs
par: Asadi, Ali, et autres
Publié: (2026)

The Limits of Tractable Marginalization
par: Broadrick, Oliver, et autres
Publié: (2025)

FormulaOne: Measuring the Depth of Algorithmic Reasoning Beyond Competitive Programming
par: Beniamini, Gal, et autres
Publié: (2025)

Expected Shapley-Like Scores of Boolean Functions: Complexity and Applications to Probabilistic Databases
par: Karmakar, Pratik, et autres
Publié: (2024)

BigO(Bench) -- Can LLMs Generate Code with Controlled Time and Space Complexity?
par: Chambon, Pierre, et autres
Publié: (2025)

Complexity of Faceted Explanations in Propositional Abduction
par: Schmidt, Johannes, et autres
Publié: (2025)

The Computational Complexity of Circuit Discovery for Inner Interpretability
par: Adolfi, Federico, et autres
Publié: (2024)

Linear Equations with Min and Max Operators: Computational Complexity
par: Chatterjee, Krishnendu, et autres
Publié: (2024)

Data Complexity in Expressive Description Logics With Path Expressions
par: Bednarczyk, Bartosz
Publié: (2024)

On the Computational Capability of Graph Neural Networks: A Circuit Complexity Bound Perspective
par: Li, Xiaoyu, et autres
Publié: (2025)

Rejection in Abstract Argumentation: Harder Than Acceptance?
par: Fichte, Johannes K., et autres
Publié: (2024)

Beyond Bilinear Complexity: What Works and What Breaks with Many Modes?
par: Brand, Cornelius, et autres
Publié: (2026)

Probabilistic and Causal Satisfiability: Constraining the Model
par: Bläser, Markus, et autres
Publié: (2025)

The Alignment Trap: Complexity Barriers
par: Yao, Jasper
Publié: (2025)

The Complexity of Optimizing Atomic Congestion
par: Brand, Cornelius, et autres
Publié: (2023)

On Deciding the Data Complexity of Answering Linear Monadic Datalog Queries with LTL Operators(Extended Version)
par: Artale, Alessandro, et autres
Publié: (2025)

Computational Irreducibility as the Foundation of Agency: A Formal Model Connecting Undecidability to Autonomous Behavior in Complex Systems
par: Azadi, Poria
Publié: (2025)

Circuit Complexity Bounds for Visual Autoregressive Model
par: Ke, Yekun, et autres
Publié: (2025)

Solving Multiagent Path Finding on Highly Centralized Networks
par: Fioravantes, Foivos, et autres
Publié: (2024)

CSPs with Few Alien Constraints
par: Jonsson, Peter, et autres
Publié: (2024)

ActionReasoningBench: Reasoning about Actions with and without Ramification Constraints
par: Handa, Divij, et autres
Publié: (2024)

Solving Quantified Boolean Formulas with Few Existential Variables
par: Eriksson, Leif, et autres
Publié: (2024)

Social Distancing Induced Coronavirus Optimization Algorithm (COVO): Application to Multimodal Function Optimization and Noise Removal
par: Varma, Om Ramakisan, et autres
Publié: (2024)

Probabilistic Explanations for Linear Models
par: Subercaseaux, Bernardo, et autres
Publié: (2024)