The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Nicola Galesi: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Salvatore Caporaso, Michele Zito, Nicola Galesi, Emanuele Covino
    Syntactic Characterization in LISP of the Polynominal Complexity Classes and Hierarchy. [Citation Graph (0, 0)][DBLP]
    CIAC, 1997, pp:61-73 [Conf]
  2. Albert Atserias, Nicola Galesi, Pavel Pudlák
    Monotone Simulations of Nonmonotone Proofs. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2001, pp:36-41 [Conf]
  3. Eli Ben-Sasson, Nicola Galesi
    Space Complexity of Random Formulae in Resolution. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2001, pp:42-51 [Conf]
  4. Nicola Galesi, Neil Thapen
    The Complexity of Treelike Systems over lamda-Local Formulae. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2004, pp:68-74 [Conf]
  5. Maria Luisa Bonet, Nicola Galesi
    Linear Lower Bounds and Simulations in Frege Systems with Substitutions. [Citation Graph (0, 0)][DBLP]
    CSL, 1997, pp:115-128 [Conf]
  6. Maria Luisa Bonet, Juan Luis Esteban, Nicola Galesi, Jan Johannsen
    Exponential Separations between Restricted Resolution and Cutting Planes Proof Systems. [Citation Graph (0, 0)][DBLP]
    FOCS, 1998, pp:638-647 [Conf]
  7. Maria Luisa Bonet, Nicola Galesi
    A Study of Proof Search Algorithms for Resolution and Polynomial Calculus. [Citation Graph (0, 0)][DBLP]
    FOCS, 1999, pp:422-432 [Conf]
  8. Josh Buresh-Oppenheim, Nicola Galesi, Shlomo Hoory, Avner Magen, Toniann Pitassi
    Rank Bounds and Integrality Gaps for Cutting Planes Procedures Joshua. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:318-0 [Conf]
  9. Albert Atserias, Nicola Galesi, Ricard Gavaldà
    Monotone Proofs of the Pigeon Hole Principle. [Citation Graph (0, 0)][DBLP]
    ICALP, 2000, pp:151-162 [Conf]
  10. Juan Luis Esteban, Nicola Galesi, Jochen Messner
    On the Complexity of Resolution with Bounded Conjunctions. [Citation Graph (0, 0)][DBLP]
    ICALP, 2002, pp:220-231 [Conf]
  11. Nicola Galesi, Oliver Kullmann
    Polynomial Time SAT Decision, Hypergraph Transversals and the Hermitian Rank. [Citation Graph (0, 0)][DBLP]
    SAT, 2004, pp:- [Conf]
  12. Nicola Galesi, Oliver Kullmann
    Polynomial Time SAT Decision, Hypergraph Transversals and the Hermitian Rank. [Citation Graph (0, 0)][DBLP]
    SAT (Selected Papers, 2004, pp:89-104 [Conf]
  13. Nicola Galesi, Neil Thapen
    Resolution and Pebbling Games. [Citation Graph (0, 0)][DBLP]
    SAT, 2005, pp:76-90 [Conf]
  14. Maria Luisa Bonet, Nicola Galesi
    Degree complexity for a modified pigeonhole principle. [Citation Graph (0, 0)][DBLP]
    Arch. Math. Log., 2003, v:42, n:5, pp:403-414 [Journal]
  15. Maria Luisa Bonet, Nicola Galesi
    Optimality of size-width tradeoffs for resolution. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2001, v:10, n:4, pp:261-276 [Journal]
  16. Albert Atserias, Nicola Galesi, Ricard Gavaldà
    Monotone Proofs of the Pigeon Hole Principle [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2000, v:7, n:8, pp:- [Journal]
  17. Albert Atserias, Nicola Galesi, Pavel Pudlák
    Monotone simulations of nonmonotone propositional proofs [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2000, v:7, n:87, pp:- [Journal]
  18. Eli Ben-Sasson, Nicola Galesi
    Space Complexity of Random Formulae in Resolution [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2001, v:8, n:31, pp:- [Journal]
  19. Nicola Galesi, Neil Thapen
    Resolution and pebbling games [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:112, pp:- [Journal]
  20. Maria Luisa Bonet, Juan Luis Esteban, Nicola Galesi, Jan Johannsen
    Exponential Separations between Restricted Resolution and Cutting Planes Proof Systems [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1998, v:5, n:35, pp:- [Journal]
  21. Nicola Galesi
    A Syntactic Characterization of Bounded-Rank Decision Trees in Terms of Decision Lists. [Citation Graph (0, 0)][DBLP]
    ITA, 1997, v:31, n:2, pp:149-158 [Journal]
  22. Albert Atserias, Nicola Galesi, Pavel Pudlák
    Monotone simulations of non-monotone proofs. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2002, v:65, n:4, pp:626-638 [Journal]
  23. Albert Atserias, Nicola Galesi, Ricard Gavaldà
    Monotone Proofs of the Pigeon Hole Principle. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 2001, v:47, n:4, pp:461-474 [Journal]
  24. Eli Ben-Sasson, Nicola Galesi
    Space complexity of random formulae in resolution. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2003, v:23, n:1, pp:92-109 [Journal]
  25. Maria Luisa Bonet, Juan Luis Esteban, Nicola Galesi, Jan Johannsen
    On the Relative Complexity of Resolution Refinements and Cutting Planes Proof Systems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:30, n:5, pp:1462-1484 [Journal]
  26. Salvatore Caporaso, Michele Zito, Nicola Galesi
    A predicative and decidable characterization of the polynomial classes of languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:250, n:1-2, pp:83-99 [Journal]
  27. Juan Luis Esteban, Nicola Galesi, Jochen Messner
    On the complexity of resolution with bounded conjunctions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:321, n:2-3, pp:347-370 [Journal]

  28. Extending Polynomial Calculus to $k$-DNF Resolution. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.005secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002