The 19th McGill Invitational Workshop on Computational Complexity will be held at Bellairs Research Institute of McGill University, Holetown, St. James, Barbados, West Indies from February 25th to March 4th, 2007. Participants are expected to arrive on Sunday afternoon, February 25th. The topic of this year's workshop will be "Rings and Integer Lattices in Computer Science".
Manindra AgrawalAddress:
Manindra AgrawalAbstract:
Department of Computer Science and Engineering
Indian Institute of Technology Kanpur
Kanpur 208016, INDIA
Finite rings, an algebraic structure, and integer lattices, a geometric structure, play a very useful role in design of algorithms for algebraic and number theoretical problems. Some examples are polynomial factorization, primality testing, breaking cryptosystems, etc. Nevertheless, one feels that the full potential of these has not been exploited yet in the algorithm design. The aim of this workshop is to introduce these structures and computational problems related to them, show how they help in solving some problems, and finally discuss how they may help in solving a number of other important problems.