Cover Image

Enumeration and updates for conjunctive linear algebra queries through expressibility

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Muñoz, Thomas, Riveros, Cristian, Vansummeren, Stijn
Format:	Preprint
Published:	2023
Subjects:	Computational Complexity Databases Data Structures and Algorithms Logic in Computer Science
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Ranked Enumeration for MSO on Trees via Knowledge Compilation
by: Amarilli, Antoine, et al.
Published: (2023)

Dynamic direct (ranked) access of MSO query evaluation over SLP-compressed strings
by: Muñoz, Martín
Published: (2026)

First Order Logic on Pathwidth Revisited Again
by: Lampis, Michael
Published: (2022)

Toward a Uniform Algorithm and Uniform Reduction for Constraint Problems
by: Barto, Libor, et al.
Published: (2026)

Fine-grained Meta-Theorems for Vertex Integrity
by: Lampis, Michael, et al.
Published: (2021)

New Algorithms and Hardness Results for Robust Satisfiability of (Promise) CSPs
by: Brakensiek, Joshua, et al.
Published: (2026)

Complex event recognition meets hierarchical conjunctive queries
by: Pinto, Dante, et al.
Published: (2024)

Direct Access for Answers to Conjunctive Queries with Aggregation
by: Eldar, Idan, et al.
Published: (2023)

Factorised Representations of Join Queries: Tight Bounds and a New Dichotomy
by: Berkholz, Christoph, et al.
Published: (2025)

Polynomial Logical Zonotope: A Set Representation for Reachability Analysis of Logical Systems
by: Alanwar, Amr, et al.
Published: (2023)

A faster FPRAS for #NFA
by: Meel, Kuldeep S., et al.
Published: (2023)

Homomorphism Indistinguishability, Multiplicity Automata Equivalence, and Polynomial Identity Testing
by: Černý, Marek, et al.
Published: (2025)

Transductive Learning Is Compact
by: Asilis, Julian, et al.
Published: (2024)

On Numbers of Simplicial Walks and Equivalent Canonizations for Graph Recognition
by: Černý, Marek
Published: (2026)

Smaller Circuits for Bit Addition
by: Goncharov, Mikhail, et al.
Published: (2025)

Constant-delay enumeration for SLP-compressed documents
by: Muñoz, Martín, et al.
Published: (2022)

MSO Queries on Trees: Enumerating Answers under Updates Using Forest Algebras
by: Kleest-Meißner, Sarah, et al.
Published: (2022)

Randomized query composition and product distributions
by: Sanyal, Swagato
Published: (2024)

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

Sublinear-query relative-error testing of halfspaces
by: Chen, Xi, et al.
Published: (2026)

Local Enumeration: The Not-All-Equal Case
by: Gurumukhani, Mohit, et al.
Published: (2025)

The Complexity of Maximal Common Subsequence Enumeration
by: Buzzega, Giovanni, et al.
Published: (2025)

The Ideal Membership Problem and Abelian Groups
by: Bulatov, Andrei A., et al.
Published: (2022)

Fair Vertex Problems Parameterized by Cluster Vertex Deletion
by: Masařík, Tomáš, et al.
Published: (2025)

On the Complexity of Hyperpath and Minimal Separator Enumeration in Directed Hypergraphs
by: Kurita, Kazuhiro, et al.
Published: (2025)

From Amortized to Worst Case Delay in Enumeration Algorithms
by: Capelli, Florent, et al.
Published: (2021)

Emit As You Go: Enumerating Edges of a Spanning Tree
by: Casel, Katrin, et al.
Published: (2025)

Enumerating models of DNF faster: breaking the dependency on the formula size
by: Capelli, Florent, et al.
Published: (2018)

Relative-error testing of conjunctions and decision lists
by: Chen, Xi, et al.
Published: (2025)

Self-referential instances of the dominating set problem are irreducible
by: Zhou, Guangyan
Published: (2026)

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

Conjugate queries can help
by: Tang, Ewin, et al.
Published: (2025)

On the Length of Strongly Monotone Descending Chains over $\mathbb{N}^d$
by: Schmitz, Sylvain, et al.
Published: (2023)

The Existential Theory of the Reals as a Complexity Class: A Compendium
by: Schaefer, Marcus, et al.
Published: (2024)

To Store or Not to Store: a graph theoretical approach for Dataset Versioning
by: Guo, Anxin, et al.
Published: (2024)

Complexity of Finding and Enumerating Interconnection Trees
by: Demange, Noé, et al.
Published: (2026)

On the formalization of the notion of an algorithm
by: Middelburg, C. A.
Published: (2024)

A sublinear query quantum algorithm for s-t minimum cut on dense simple graphs
by: Apers, Simon, et al.
Published: (2021)

Boolean function monotonicity testing requires (almost) $n^{1/2}$ queries
by: Chen, Mark, et al.
Published: (2025)

Deterministic factorization of constant-depth algebraic circuits in subexponential time
by: Bhattacharjee, Somnath, et al.
Published: (2025)