We derive a new entropic quantum uncertainty relation involving min-entropy. The relation is tight and can be applied in various quantum-cryptographic settings. Protocols for quant...
Abstract. We solve the problem of extending Bird and Paterson’s generalized folds for nested datatypes and its dual to inductive and coinductive constructors of arbitrarily high ...
Courcelle's famous theorem from 1990 states that any property of graphs definable in monadic second-order logic (MSO2) can be decided in linear time on any class of graphs of ...
We present a formal procedure for structure-preserving model reduction of linear second-order and Hamiltonian control problems that appear in a variety of physical contexts, e.g., ...
In this article we describe a very efficient method to construct pairwise nonisomorphic posets (equivalently, T0 topologies). We also give the results obtained by a computer progr...