TOP
Search the Dagstuhl Website
Looking for information on the websites of the individual seminars? - Then please:
Not found what you are looking for? - Some of our services have separate websites, each with its own search option. Please check the following list:
Schloss Dagstuhl - LZI - Logo
Schloss Dagstuhl Services
Seminars
Within this website:
External resources:
  • DOOR (for registering your stay at Dagstuhl)
  • DOSA (for proposing future Dagstuhl Seminars or Dagstuhl Perspectives Workshops)
Publishing
Within this website:
External resources:
dblp
Within this website:
External resources:
  • the dblp Computer Science Bibliography


Dagstuhl Seminar 22301

Algorithmic Aspects of Information Theory

( Jul 24 – Jul 29, 2022 )


Permalink
Please use the following short url to reference this page: https://www.dagstuhl.de/22301

Organizers

Contact

Shared Documents

Schedule

Motivation

Constraints on entropies constitute the “laws of information theory”. These constraints go well beyond Shannon’s basic information inequalities, as they include not only information inequalities that cannot be derived from Shannon’s basic inequalities, but also conditional inequalities and disjunctive inequalities that are valid for all entropic functions. By now, there is an extensive body of research on constraints on entropies and their applications to different areas of mathematics and computer science. So far, however, little progress has been made on the algorithmic aspects of information theory. In fact, even fundamental questions about the decidability of information inequalities and their variants remain open to date.

Recently, research in different applications has demonstrated a clear need for algorithmic solutions to questions in information theory. These applications include: finding tight upper bounds on the answer to a query on a relational database, the homomorphism domination problem and its uses in query optimization, the conditional independence implication problem, soft constraints in databases, group-theoretic inequalities, and lower bounds on the information ratio in secret sharing. Thus far, the information-theory community has had little interaction with the communities where these applications have been studied or with the computational complexity community. The main goal of this Dagstuhl Seminar is to bring together researchers from the aforementioned communities and to develop an agenda for studying algorithmic aspects of information theory, motivated from a rich set of diverse applications. By using the algorithmic lens to examine the common problems and by transferring techniques from one community to the other, we expect that bridges will be created and some tangible progress on open questions may be made.

In addition to tutorials and talks, there will be ample time for discussions, informal interactions, and open problem sessions aiming to produce a comprehensive list of problems in algorithmic aspects of information theory.

Copyright Phokion G. Kolaitis, Andrej E. Romashchenko, Milan Studeny, and Dan Suciu

Participants
On-site
Remote:

Classification
  • Computational Complexity
  • Databases
  • Information Theory

Keywords
  • information theory
  • information inequalities
  • conditional independence structures
  • database query evaluation and containment
  • decision problems