The purpose of this note is to give upper bounds (assuming P different from NP) on how far the generalizations of Skolem sequences can be taken while still hoping to resolve the ex...
A set of lecture notes that introduces the reader to the object-orientation as a new programming concept. However, this is not a course for learning the C++ programming language.
Set of lecture notes for the algorithms classes required for all computer science undergraduate and graduate students at the University of Illinois, Urbana-Champaign.
Generalization of the covariance concept is discussed for mixed categorical and numerical data. Gini's definition of variance for categorical data gives us a starting point to...
The AND problem on t bits is a promise decision problem where either at most one bit of the input is set to 1 (NO instance) or all t bits are set to 1 (YES instance). In this note...