Recherche

An algebraic circuit computes a polynomial using addition and multiplication operators. Understanding the power of algebraic circuits has close

We show that interactive protocols between a prover and a verifier, a well-known tool of complexity theory, can be used in practice to certify the

** Enumeration Classes Defined by Circuits ** We refine the complexity landscape for enumeration problems by introducing very low classes defined by

/Exposé en anglais/Talk in english/ We consider an edge version of the famous (and hard) degree-diameter problem, where one is wondering about the

/Exposé en anglais/Talk in english/ Let G be a bridgeless cubic graph. The Berge-Fulkerson Conjecture (1970s) states that G admits a list of six

Any Physical Theory of Nature Must Be Boundlessly Multipartite Nonlocal [Note: no quantum background is needed to attend this talk] Quantum

Sébastien Bouchard, LaBRI Titre: Byzantine gathering in polynomial time. Abstract: Gathering is a key task in distributed and mobile systems, which

Linear Temporal Logic (LTL) is one of the most common formalisms for expressing properties of systems in formal verification and other fields. However

Petri nets constitute a well-studied model to verify and study concurrent systems, among others, and computing the coverability set is one of the most

/Exposé /Talk/ Recent developments in the intersection of structural graph theory, parameterized algorithms, and finite model theory have provided