Image de couverture de livre

The Complexity of Finding Missing Answer Repairs

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Comer, Jesse, Tannen, Val
Format:	Preprint
Publié:	2026
Sujets:	Databases Computational Complexity
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

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

A Unifying Algorithm for Hierarchical Queries
par: Khamis, Mahmoud Abo, et autres
Publié: (2025)

Provenance Analysis and Semiring Semantics for First-Order Logic
par: Grädel, Erich, et autres
Publié: (2024)

Approximately Counting Answers to Conjunctive Queries with Disequalities and Negations
par: Focke, Jacob, et autres
Publié: (2021)

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

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

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

Towards Parameterized Hardness on Maintaining Conjunctive Queries
par: Wang, Qichen
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)

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

Fast Matrix Multiplication meets the Submodular Width
par: Abo-Khamis, Mahmoud, et autres
Publié: (2024)

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

Evaluating Datalog over Semirings: A Grounding-based Approach
par: Zhao, Hangdong, et autres
Publié: (2024)

Fine-Grained Complexity of Regular Path Queries
par: Casel, Katrin, et autres
Publié: (2021)

The Complexity of Order-Finding for ROABPs
par: Bhargava, Vishwas, et autres
Publié: (2024)

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

Matching walks that are minimal with respect to edge inclusion
par: Marsault, Victor
Publié: (2024)

From Time to Space: The Impact of Linearity in Higher-Order Datalog
par: Charalambidis, Angelos, et autres
Publié: (2026)

The Power of Negation in Higher-Order Datalog
par: Charalambidis, Angelos, et autres
Publié: (2025)

Multiparty Communication Complexity of Collision Finding
par: Beame, Paul, et autres
Publié: (2024)

A Parameterized-Complexity Framework for Finding Local Optima
par: Ganian, Robert, et autres
Publié: (2026)

Optimal Proof Systems for Complex Sets are Hard to Find
par: Egidy, Fabian, et autres
Publié: (2024)

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

Enumeration and updates for conjunctive linear algebra queries through expressibility
par: Muñoz, Thomas, et autres
Publié: (2023)

Enhancing Grover's Search Algorithm: A Modified Approach to Increase the Probability of Good States
par: Abdulrahman, Ismael
Publié: (2024)

New Algebrization Barriers to Circuit Lower Bounds via Communication Complexity of Missing-String
par: Chen, Lijie, et autres
Publié: (2025)

To Store or Not to Store: a graph theoretical approach for Dataset Versioning
par: Guo, Anxin, et autres
Publié: (2024)

The Complexity of Finding and Counting Subtournaments
par: Döring, Simon, et autres
Publié: (2025)

Generalizing Fair Top-$k$ Selection: An Integrative Approach
par: Cai, Guangya
Publié: (2026)

The Complexity of Resilience for Digraph Queries
par: Bodirsky, Manuel, et autres
Publié: (2026)

Space Complexity Dichotomies for Subgraph Finding Problems in the Streaming Model
par: Shih, Yu-Sheng, et autres
Publié: (2026)

The Structural Complexity Landscape of Finding Balance-Fair Shortest Paths
par: Bentert, Matthias, et autres
Publié: (2024)

The Complexity of Finding Local Optima in Contrastive Learning
par: Yan, Jingming, et autres
Publié: (2025)

Complexity of Local Search for Euclidean Clustering Problems
par: Manthey, Bodo, et autres
Publié: (2023)

Complexity of Finding and Enumerating Interconnection Trees
par: Demange, Noé, et autres
Publié: (2026)

On the Hardness of Order Finding and Equivalence Testing for ROABPs
par: Ramya, C., et autres
Publié: (2025)

The Adaptive Complexity of Finding a Stationary Point
par: Zhou, Huanjian, et autres
Publié: (2025)

The Randomized Query Complexity of Finding a Tarski Fixed Point on the Boolean Hypercube
par: Brânzei, Simina, et autres
Publié: (2024)