Sfoglia per Autore  

Opzioni
Mostrati risultati da 1 a 20 di 55
Titolo Data di pubblicazione Autore(i) File
A Syntactic Characterization of Bounded-Rank Decision Trees in Terms of Decision Lists. 1997 Galesi, Nicola
Exponential Separations between Restricted Resolution and Cutting Planes Proof Systems 1998 BONET M., L; Esteban, J. L.; Galesi, Nicola; Johannsen, J.
A Study of Proof Search Algorithms for Resolution and Polynomial Calculus 1999 Bonet, M. L.; Galesi, Nicola
On the Relative Complexity of Resolution Refinements and Cutting Planes Proof Systemsv 2000 Bont, M. L.; Esteban, J. L.; Galesi, Nicola; Johannsen, J.
Monotone Proofs of the Pigeon Hole Principle 2000 Atserias, A.; Galesi, Nicola; Gavalda, R.
Optimality of size-width tradeoffs for resolution 2001 Maria Luisa, Bonet; Galesi, Nicola
A predicative and decidable characterization of the polynomial classes of languages 2001 S., Caporaso; M., Zito; Galesi, Nicola
Space Complexity of Random Formulae in Resolution 2001 BEN SASSON, E.; Galesi, Nicola
Monotone Simulations of Nonmonotone Proofs. 2001 Atserias, A.; Galesi, Nicola; Pudlak, P.
Monotone Proofs of the Pigeon Hole Principle 2001 Atserias, A.; Galesi, Nicola; Gavalda, R.
Monotone Simulations of Nonmonotone Proofs 2002 A., Atserias; Galesi, Nicola; P., Pudlak
On the complexity of resolution with bounded conjunctions. 2002 Juan Luis, Esteban; Galesi, Nicola; Jochen, Messner
Space complexity of random formulae in resolution 2003 Eli Ben, Sasson; Galesi, Nicola
Degree complexity for a modified pigeonhole principle 2003 Maria Luisa, Bonet; Galesi, Nicola
Rank Bounds and Integrality Gaps for Cutting Planes Procedures 2003 BURESH OPPENHEIM, J.; Galesi, Nicola; Hoory, S.; Magen, A.; Pitassi, T.
Polynomial Time SAT Decision, Hypergraph Transversals and the Hermitian Rank 2004 Galesi, Nicola; Kullmann, O.
On the complexity of resolution with bounded conjunctions 2004 Juan Luis, Esteban; Galesi, Nicola; Jochen, Messner
The Complexity of Treelike Systems over lamdda-Local Formulae 2004 Galesi, Nicola; Thapen, N.
Resolution and Pebbling Games 2005 Galesi, Nicola; Thapen, N.
Rank Bounds and Integrality Gaps for Cutting Planes Procedures 2006 J., BURESH OPPENHEIM; Galesi, Nicola; A., Magen; S., Hoory; T., Pitassi
Mostrati risultati da 1 a 20 di 55
Legenda icone

  •  file ad accesso aperto
  •  file disponibili sulla rete interna
  •  file disponibili agli utenti autorizzati
  •  file disponibili solo agli amministratori
  •  file sotto embargo
  •  nessun file disponibile