Image de couverture de livre

Expected Shapley-Like Scores of Boolean Functions: Complexity and Applications to Probabilistic Databases

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Karmakar, Pratik, Monet, Mikaël, Senellart, Pierre, Bressan, Stéphane
Format:	Preprint
Publié:	2024
Sujets:	Databases 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

Capturing P: On the Expressive Power and Efficient Evaluation of Boolean Retrieval
par: Aavani, Amir
Publié: (2026)

The Shapley Value in Database Management
par: Bertossi, Leopoldo, et autres
Publié: (2024)

Learning Tree Pattern Transformations
par: Neider, Daniel, et autres
Publié: (2024)

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

The Complexity of Finding Missing Answer Repairs
par: Comer, Jesse, et autres
Publié: (2026)

Parameterised Complexity of Consistent Query Answering via Graph Representations
par: Hankala, Teemu, et autres
Publié: (2024)

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

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

Shapley Value Computation in Ontology-Mediated Query Answering
par: Bienvenu, Meghyn, et autres
Publié: (2024)

Shapley Revisited: Tractable Responsibility Measures for Query Answers
par: Bienvenu, Meghyn, et autres
Publié: (2025)

A Complexity Map of Probabilistic Reasoning for Neurosymbolic Classification Techniques
par: Ledaguenel, Arthur, 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)

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

Exact Algorithms for Multiagent Path Finding with Communication Constraints on Tree-Like Structures
par: Fioravantes, Foivos, et autres
Publié: (2024)

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

Provable Failure of Language Models in Learning Majority Boolean Logic via Gradient Descent
par: Chen, Bo, 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)

The Complexity of Symmetry Breaking Beyond Lex-Leader
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)

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)

Lower Bounds for Conjunctive Query Evaluation
par: Mengel, Stefan
Publié: (2025)

PFCS: Prime Factorization Cache System for Deterministic Data Relationship Discovery
par: Le, Duy
Publié: (2025)

Circuits and Formulas for Datalog over Semirings
par: Fan, Austen Z., et autres
Publié: (2025)

Jaguar: A Primal Algorithm for Conjunctive Query Evaluation in Submodular-Width Time
par: Khamis, Mahmoud Abo, et autres
Publié: (2026)

Diversity of Answers to Conjunctive Queries
par: Merkl, Timo Camillo, et autres
Publié: (2023)

Towards Parameterized Hardness on Maintaining Conjunctive Queries
par: Wang, Qichen
Publié: (2026)

Tight Fine-Grained Bounds for Direct Access on Join Queries
par: Bringmann, Karl, et autres
Publié: (2022)

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

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

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

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)

On Probabilistic and Causal Reasoning with Summation Operators
par: Ibeling, Duligur, et autres
Publié: (2024)

Inconsistency Handling in Prioritized Databases with Universal Constraints: Complexity Analysis and Links with Active Integrity Constraints
par: Bienvenu, Meghyn, et autres
Publié: (2023)

Finding a Fair Scoring Function for Top-$k$ Selection: From Hardness to Practice
par: Cai, Guangya
Publié: (2025)

On the Rational Degree of Boolean Functions and Applications
par: Iyer, Vishnu, et autres
Publié: (2023)