Recherche
Let f, g1, …, gm be polynomials with real coefficients in n variables. Suppose the minimum f* of f over the semialgebraic set S(g) = {x in R^n : g_i(x
We define a method that takes advantage of structural reductions to accelerate the verification of reachability problems. We prove the correctness of
Simulating noninteracting systems of fermionic particles (such as electrons) -- so called 'free fermions' -- is a basic routine in computational many
This talk presents the work I did during my thesis, which I completed in March. Petri nets are a classic formal model for concurrent systems
In order to understand and verify complex systems, we need accurate models that are either understandable for humans or can be analyzed fully
Mouna Safir (IRIF) Title: Some new results with k-set agreement Abstract: In this talk, I will present our investigation of the solvability of k-set
The talk is in two parts. In the first part, we prove a lower bound on the scrambling speed of a random quantum circuit. We give three applications of
Ultrametrics are representations of data that emphasize hierarchical properties and are widely used in data visualization and clustering. In the
A sublinear-time quantum algorithm for approximating partition functions Gibbs partition functions are ubiquitous in statistical physics and in