Channels - Fine-Grained Complexity of Regular Path Queries :: FRELIP Discovery

Similar Items: Fine-Grained Complexity of Regular Path Queries

Quick Look
Semantic Tree-Width and Path-Width of Conjunctive Regular Path Queries
Quick Look
Datalog Rewritings of Regular Path Queries using Views
Quick Look
Modular Path Queries with Arithmetic
Quick Look
Expressive Path Queries on Graph with Data
Quick Look
A Trichotomy for Regular Trail Queries
Quick Look
Fine-grained Meta-Theorems for Vertex Integrity
Quick Look
Dynamic Complexity of Parity Exists Queries
Quick Look
Fine-grained Analysis and Faster Algorithms for Iteratively Solving Linear Systems
Quick Look
The Data Complexity of Ontology-Mediated Queries with Closed Predicates
Quick Look
Fine-Grained Change Point Detection for Topic Modeling with Pitman-Yor Process
Quick Look
Toward Unified Fine-Grained Vehicle Classification and Automatic License Plate Recognition
Quick Look
The Complexity of Aggregates over Extractions by Regular Expressions
Quick Look
Fine-grained ranking to boost unsupervised sentence embeddings
Quick Look
ReLoC Reloaded: A Mechanized Relational Logic for Fine-Grained Concurrency and Logical Atomicity
Quick Look
Optimally Rewriting Formulas and Database Queries: A Confluence of Term Rewriting, Structural Decomposition, and Complexity
Quick Look
search-query: An open source Python library for academic search queries
Quick Look
Querying the Guarded Fragment
Quick Look
Fine-Grained Disentanglement for Alleviating Inconsistencies in Cross-Modal Hashing Retrieval
Quick Look
FineState-Bench: Benchmarking State-Conditioned Grounding for Fine-grained GUI State Setting
Quick Look
Equivalence of Coarse and Fine-Grained Models for Learning with Distribution Shift
Quick Look
Fine-grained Analysis and Faster Algorithms for Iteratively Solving Linear Systems
Quick Look
Fine-grained Analysis and Faster Algorithms for Iteratively Solving Linear Systems
Quick Look
Fine-grained Analysis and Faster Algorithms for Iteratively Solving Linear Systems
Quick Look
Diversity of Answers to Conjunctive Queries