Previous Conferences & Workshops

Sep
02
2004

Bloch-Kato Conjecture

12:00am

During the academic year 2004-2005 the School of Mathematics hosted a program on the Bloch-Kato conjecture relating Milnor's

K-theory and the etale cohomology. The activities of the program included two or more weekly courses which covered the...

May
18
2004

Computer Science/Discrete Mathematics Seminar II

Ruling Out PTAS for Graph Min-Bisection
Subhash Khot
10:30am|S-101

Graph Min-Bisection is the following problem: Given a graph, partition it into two equal parts so as to minimize the number of crossing edges. The problem arises as a subroutine in many graph algorithms that rely on divide-and-conquer strategy...

May
04
2004

Computer Science/Discrete Mathematics Seminar II

Ruling Out PTAS for Graph Min-Bisection
Subhash Khot
10:30am|S-101

Graph Min-Bisection is the following problem: Given a graph, partition it into two equal parts so as to minimize the number of crossing edges. The problem arises as a subroutine in many graph algorithms that rely on divide-and-conquer strategy...

May
03
2004

Computer Science/Discrete Mathematics Seminar I

Fast Quantum Algorithms for Computing the Unit Group and Class Group of a Number Field
Sean Hallgren
11:15am|S-101

Computing the unit group and class group of a number field are two of the main tasks in computational algebraic number theory. Factoring integers reduces to a special case of computing the unit group, but a reduction in the other direction is not...