This is a preview. Log in through your library . Abstract The well-known algorithm of Billevich for finding units in algebraic number fields is derived by algebraic methods. Some tables of units in ...

This paper develops an algorithm for pure integer programming problems. It first transforms the integer programming problem to an algebraically equivalent Hermite canonical problem, and then employs ...

Jeremy Johnson is Professor of Computer Science and Electrical and Computer Engineering at Drexel University. He served as the first Department Head for the newly formed Computer Science department ...

Quantum computers can do wondrous things: too bad they do not exist yet. That has not stopped physicists from devising new algorithms for the devices, which can calculate a lot faster than ordinary ...

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, ...

*Please note this will be a 0 credit 3-week course during the weeks of May 1-17. This course does not fulfill the Technical Elective area.