Back to Results
First PageMeta Content
Computational 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


Document Date: 2008-12-17 14:33:43

Open Document

File Size: 81,19 KB

Share Result on Facebook

City

Moscow / Helsinki / Jerusalem / Tel-Aviv / New York / Paris / Atlanta / Vancouver / Prague / Aarhus / Beijing / Toronto / Vienna / London / Chicago / Edinburgh / /

Company

Cambridge University Press / Special Interest Group / Algebraic Proof Systems / Oxford University Press / SIAM Journal / Boolean Function Complexity / /

Country

Russia / Denmark / /

EntertainmentAwardEvent

Current community service • Ackermann Annual Award / /

Facility

Fields Institute / Princeton University / Toyota Technological Institute / Steklov Institute of Mathematics / Banff International Research Station / University of Chicago / Moscow University / Cornell University / Steklov Mathematical Institute / Rutgers University / Computer Science Center / Pacific Institute / /

IndustryTerm

free groups / bounded-depth networks / Internet Mathematics / free / /

Organization

Steklov Institute of Mathematics / Cambridge University / Department of Mechanics / International Mathematical Union / Rutgers University / Fields Institute / Institute for Advanced Study / Princeton University / Russian Academy of Science / Russian Academy of Sci / European Mathematical Society / Steklov Mathematical Institute / Cornell University / Association for Computing Machinery / Pacific Institute for the Matematical Sciences / International Congress / University of Chicago / Department of Computer Science / Computer Science Center / European Association for Theoretical Computer Science / European Association for Computer Science Logic / Moscow University / Toyota Technological Institute / Andrew MacLeish Distinguished Service / Oxford University / Academy of Sciences of the USSR / /

Person

Bounded Arithmetic / M.S. Paterson / Alexander A. Razborov / Andrew MacLeish / Rolf Nevanlinna / Feasible Mathematics II / Computational Complexity / A. A. Razborov / Proof Theory / Alfred Tarsky / S.I.Adian / /

Position

principal researcher / leading researcher / Advisor / editor / executive member of the Board / joint advisor with S.I.Adian / researcher / Professor / chair / /

ProvinceOrState

New York / /

PublishedMedium

Izvestiya /

URL

http /

SocialTag