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
Simulating noninteracting systems of fermionic particles (such as electrons) -- so called 'free fermions' -- is a basic routine in computational many
We define a method that takes advantage of structural reductions to accelerate the verification of reachability problems. We prove the correctness of
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
A graph is reconstructible if it is determined up to isomorphism by the multiset of its proper induced subgraphs. The reconstruction conjecture
A sublinear-time quantum algorithm for approximating partition functions Gibbs partition functions are ubiquitous in statistical physics and in
Oblivious Transfer from Zero-Knowledge Proofs, or How to Achieve Round-Optimal Quantum Oblivious Transfer and Zero-Knowledge Proofs on Quantum States