Detecting and counting the number of copies of certain subgraphs (also known as network motifs or graphlets), is motivated by applications in a variety of areas ranging from Biolo...
We analyze a model of irreversible investment with two sources of uncertainty. A riskneutral decision maker has the choice between two mutually exclusive projects under input pric...
Abstract. The complexity of interpolation attacks on block ciphers depends on the degree of the polynomial approximation and or on the number of terms in the polynomial approximati...
We prove that, for all d 4, there are Salem numbers of degree 2d and trace -1, and that the number of such Salem numbers is d/ (log log d)2 . As a consequence, it follows that the...
We prove that the total chromatic number of any graph with maximum degree is at most plus an absolute constant. In particular, we show that for su ciently large, the total chromat...