First Page | Document Content | |
---|---|---|
![]() Date: 2008-12-17 14:33:43Computational complexity theory Logic in computer science Alexander Razborov Automated theorem proving Natural proof Nevanlinna Prize Proof complexity Frege system Steven Rudich Theoretical computer science Applied mathematics Mathematics | Source URL: www.cs.uchicago.eduDownload Document from Source WebsiteFile Size: 81,19 KBShare Document on Facebook |
![]() | INTERNATIONAL MATHEMATICAL UNION László Lovász, President Martin Grötschel, Secretary http://www.mathunion.org Press InformationDocID: 1p507 - View Document |
![]() | hlf_2016_participating_laureates.inddDocID: 1oVAO - View Document |
![]() | Final Feb 27, 2011 as approved by the IMU Executive Committee Report of the 16th General Assembly of the International Mathematical Union (IMU) Bangalore, IndiaDocID: 1fASY - View Document |
![]() | Outline Four Results of Jon Kleinberg 1 Nevanlinna Prize for Jon KleinbergDocID: 10W5v - View Document |
![]() | 3rd Heidelberg Laureate Forum August 23 – 28, 2015 Abel, Fields and Turing Laureates Meet the Next GenerationDocID: 10fTI - View Document |