Introduces students to ideas and techniques from discrete mathematics that are widely used in science and engineering. Mathematical definitions and proofs are emphasized. Topics include formal logic ...

In this paper, we have proved that the lower bound of the number of real multiplications for computing a length 2t real GFT(a,b) (a = ±1/2, b = 0 or b = ±1/2, a = 0) is 2t+1 – 2t - 2 and that for ...

This course will discuss fundamental concepts and tools in discrete mathematics with emphasis on their applications to computer science. Example topics include logic and Boolean circuits; sets, ...