Nicola Galesi




Associate Professor Ph.D. Universitat Politècnica de Catalunya (2000)http://www.lsi.upc.edushapeimage_2_link_0

galesi at di dot uniroma1 dot it

T. +39.06.4991.8412

F. +39.06.854.1842

Dipartimento di Informatica Via Salaria 113 00198 Rome Italyhttp://www.di.uniroma1.itshapeimage_3_link_0

Home   Research   Teaching    Pubblications    Activities     Students          

Research interests Computational Complexity Theory, Logic in Computer Science.

You can be  true you can be false,

You’ll be given the same reward.

J. Strummer

Profile Since 2005 at La Sapienza in Rome. Before: associate professor at UPC in Barcelona (01-05) postdoc at University of Toronto (02-03) member at the Institute for Advanced Studies in Princeton (00-01) Studies in Barcelona with Maria Luisa Bonet (95-00)http://www.uniroma1.ithttp://www.upc.eduhttp://www.lsi.upc.eduhttp://cs.toronto.eduhttp://www.math.ias.eduhttp://www.lsi.upc.es/~bonet/http://www.templeton.org/shapeimage_5_link_0shapeimage_5_link_1shapeimage_5_link_2shapeimage_5_link_3shapeimage_5_link_4shapeimage_5_link_5

Curriculum Vitae

List of Publications

 

Teaching

Modelli e Ottimizzazione (I sem)

Teoria della Computazione (II sem)

Tesi di Laurea

Introduzione al linguaggio Python 3

Percorso Magistrale Matematica Discreta e Informatica Teorica

Research

Science

Beyersdorff, N. Galesi, M. Lauria, A Razborov. Parameterized Bounded Depth Frege is Not Optimal L. Carlucci, N.Galesi, M. Lauria Paris-Harrington Tautologies http://www.dsi.uniroma1.it/~galesi/parres.pdfhttp://www.dsi.uniroma1.it/~galesi/PH.pdfshapeimage_7_link_0shapeimage_7_link_1
2012 Workshop Limits on Theorem Proving SAT Interactions - Dagstuhl 2012 2012 Computer Science Logic 2012 IEEE Conference on Computational Complexity SeT - Theory Seminars JSAT- Journal of Satisfiability IOI - International Olympiad InformaticsLiThPr.htmlhttp://www.dagstuhl.de/en/program/calendar/semhp/?semnr=12471http://csl2012.lacl.fr/http://computationalcomplexity.org/cfp.htmlhttp://set.di.uniroma1.it/http://jsat.ewi.tudelft.nl/http://www.olimpiadi-informatica.it/shapeimage_8_link_0shapeimage_8_link_1shapeimage_8_link_2shapeimage_8_link_3shapeimage_8_link_4shapeimage_8_link_5shapeimage_8_link_6

Grants

The Limits of Theorem Proving. Granted by John Templeton Foundation (2011-2013, Project Leader ) Complessità e Rappresentabilità Compatta di Strutture Discrete. Granted by Sapienza (2009-2011, Project Leader )http://www.thi.uni-hannover.de/en/research/limits-of-theorem-proving/http://www.templeton.org/shapeimage_9_link_0shapeimage_9_link_1