Abstract. We study the computational complexity of deciding the existence of a Hamiltonian Cycle in some dense classes of k-uniform hypergraphs. Those problems turned out to be, al...
Marek Karpinski, Andrzej Rucinski, Edyta Szymanska
Abstract. In this paper, we generalize the previous formal de nitions of random-self-reducibility. We show that, even under our very general de nition, sets that are complete for a...
Abstract. We propose c2-calculus, which is a second-order polymorphic call-by-value calculus with extensional universal types. Unlike product types or function types in call-by-val...
Abstract. In this paper we provide a theoretical discussion of the impact of uncertainty in quality measurement on the expected benefits of including biometric signal quality measu...
Abstract-- In this paper, we introduce the class of semiseparable kernel functions for use in constructing Lyapunov functions for distributed-parameter systems such as delaydiffere...