Accessing Answers to Unions of Conjunctive Queries with Ideal Time Guarantees: II
Subscribers:
68,700
Published on ● Video Link: https://www.youtube.com/watch?v=-U3T8FNr628
Nofar Carmeli (Inria Montpellier)
https://simons.berkeley.edu/talks/nofar-carmeli-inria-montpellier-2023-09-25-0
Fine-Grained Complexity, Logic, and Query Evaluation
Other Videos By Simons Institute for the Theory of Computing
Tags:
Simons Institute
theoretical computer science
UC Berkeley
Computer Science
Theory of Computation
Theory of Computing
Fine-Grained Complexity Logic and Query Evaluation
Nofar Carmeli