Generators and Relations for O

Tate's algorithm for computing K_2 O_F for rings of integers in a number field has been adapted for the computer and gives explicit generators for the group and sharp bounds on their order---the latter, together with some structural results on the p-primary part of K_2 O_F due to Tate and Keune, gives a proof of its structure for many number fields of small discriminants, confirming earlier conjectural results. For the first time, tame kernels of non-Galois fields are obtained.