Travelled to:1 × Denmark
1 × Spain
1 × USA
1 × United Kingdom
2 × Canada
2 × Switzerland
Collaborated with:O.Kullmann O.Beyersdorff M.Lauria N.Thapen M.L.Bonet J.L.Esteban J.Messner A.Atserias R.Gavaldà A.A.Razborov
Talks about:bound (3) hypergraph (2) transvers (2) parameter (2) hermitian (2) polynomi (2) resolut (2) complex (2) frege (2) decis (2)
Person: Nicola Galesi
DBLP: Galesi:Nicola
Contributed to:
2011
201120052004200520022000
1997Wrote 8 papers:
- ICALP-v1-2011-BeyersdorffGLR #bound
- Parameterized Bounded-Depth Frege Is Not Optimal (OB, NG, ML, AAR), pp. 630–641.
- SAT-2011-BeyersdorffGL #complexity
- Parameterized Complexity of DPLL Search Procedures (OB, NG, ML), pp. 5–18.
- SAT-2005-GalesiT #game studies
- Resolution and Pebbling Games (NG, NT), pp. 76–90.
- SAT-2004-GalesiK #polynomial #rank #satisfiability
- Polynomial Time SAT Decision, Hypergraph Transversals and the Hermitian Rank (NG, OK), pp. 76–85.
- SAT-J-2004-GalesiK05 #polynomial #rank #satisfiability
- Polynomial Time SAT Decision, Hypergraph Transversals and the Hermitian Rank (NG, OK), pp. 89–104.
- ICALP-2002-EstebanGM #bound #complexity #on the
- On the Complexity of Resolution with Bounded Conjunctions (JLE, NG, JM), pp. 220–231.
- ICALP-2000-AtseriasGG #principle #proving
- Monotone Proofs of the Pigeon Hole Principle (AA, NG, RG), pp. 151–162.
- CSL-1997-BonetG #bound #linear #simulation
- Linear Lower Bounds and Simulations in Frege Systems with Substitutions (MLB, NG), pp. 115–128.