scientific article; zbMATH DE number 7561481
From MaRDI portal
Publication:5091136
DOI10.4230/LIPIcs.ICDT.2019.21MaRDI QIDQ5091136
Dan Suciu, Dan Olteanu, Khamis Mahmoud Abo, Hung Quang Ngo
Publication date: 21 July 2022
Full work available at URL: https://arxiv.org/abs/1712.07445
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Tensor Decompositions and Applications
- Asymptotic behavior of the chromatic index for hypergraphs
- On the complexity of database queries
- Answering conjunctive queries with inequalities
- Parametrized complexity theory.
- Algorithmic construction of sets for k -restrictions
- Understanding the Complexity of Induced Subgraph Isomorphisms
- Constraint solving via fractional edge covers
- On Acyclic Conjunctive Queries and Constant Delay Enumeration
- Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs
- Color-coding
- Tensor Decomposition for Signal Processing and Machine Learning
- Deciding First-Order Properties of Nowhere Dense Graphs
- Size Bounds for Factorised Representations of Query Results
- On the Chromatic Index of Random Uniform Hypergraphs
- Explicit Nonadaptive Combinatorial Group Testing Schemes
- Tractable Hypergraph Properties for Constraint Satisfaction and Conjunctive Queries
- On the degree, size, and chromatic index of a uniform hypergraph
