YoVDO

A Quick and Partial Survey on the Complexity of Query Answering

Offered By: Centre International de Rencontres Mathématiques via YouTube

Tags

Computational Complexity Courses Discrete Mathematics Courses Logic Courses Homomorphisms Courses Constraint Satisfaction Problems Courses Parameterized Complexity Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore a comprehensive conference talk on the complexity of query answering presented by Arnaud Durand at the Centre International de Rencontres Mathématiques in Marseille, France. Delve into this hour-long presentation, recorded during the thematic meeting "Discrete mathematics and logic: between mathematics and the computer science" on January 19, 2023. Gain insights into the intricate relationship between discrete mathematics, logic, and computer science. Access this video and other talks by renowned mathematicians through CIRM's Audiovisual Mathematics Library, which offers enhanced features such as chapter markers, keywords, enriched content with abstracts and bibliographies, and a multi-criteria search function. Benefit from the professional filming by Guillaume Hennenfent, ensuring a high-quality viewing experience of this partial survey on query answering complexity.

Syllabus

Arnaud Durand : A quick and partial survey on the complexity of query answering


Taught by

Centre International de Rencontres Mathématiques

Related Courses

AI:Constraint Satisfaction
Indian Institute of Technology Madras via Swayam
Artificial Intelligence
Udacity
Create your own Sudoku Solver using AI and Python
Coursera Project Network via Coursera
Python برنامج لحل لعبة السودوكو بالذكاء الاصطناعى باستخدام
Coursera Project Network via Coursera
Artificial Intelligence
NPTEL via YouTube