Searching for authors named "Nicola Galesi" – sorted by Relevance.
16 documents found, showing 1 through 10.
Next 10 →
-
A Syntactic Characterization of Bounded-Rank Decision Trees in Terms of Decision Lists
- …A syntactic characterization of bounded-rank decision trees in terms of decision lists Nicola…
- Cited by 1 (0 self) – Add To MetaCart
-
Polynomial time sat decision, hypergraph transversals and the hermitian rank
- …Polynomial time SAT decision, hypergraph transversals and the Hermitian rank Nicola Galesi 1…
- Cited by 4 (3 self) – Add To MetaCart
-
Space Complexity of Random Formulae in Resolution
- … Hebrew University Jerusalem, Israel e-mail: elli@(email omitted); Nicola Galesi y Departament de…
- Cited by 18 (3 self) – Add To MetaCart
-
Syntactic Characterization In Lisp Of The Polynomial Complexity Classes And Hierarchy
- … Caporaso 1 , Michele Zito 12 Nicola Galesi 13 and Emanuele Covino 14 1 Univ di Bari, Dip. di…
- Add To MetaCart
-
Monotone Proofs of the Pigeon Hole Principle
- …Monotone Proofs of the Pigeon Hole Principle Albert Atserias y Nicola Galesi z Ricard Gavald…
- Cited by 1 (0 self) – Add To MetaCart
-
Monotone Simulations of Nonmonotone Proofs
- … Catalunya Barcelona, Spain atserias@(email omitted); Nicola Galesi y Universitat Polit`ecnica de Catalunya…
- Cited by 4 (2 self) – Add To MetaCart
-
Linear lower bounds and simulations in Frege systems with substitutions
- … ?? Nicola Galesi ??? Abstract. We investigate the complexity of proofs in Frege (F), Substitution Frege (s…
- Add To MetaCart
-
Degree Complexity for a Modified Pigeonhole Principle
- … Spain e-mail bonet@(email omitted); Nicola Galesi z School of Mathematics Institute for Advanced Study…
- Add To MetaCart
-
Rank bounds and integrality gaps for cutting planes procedures
- … and Integrality Gaps for Cutting Planes Procedures Joshua Buresh-Oppenheim ∗ Nicola Galesi † Shlomo Hoory ‡ Avner…
- Cited by 22 (5 self) – Add To MetaCart
-
A Study of Proof Search Algorithms for Resolution and Polynomial Calculus
- … Nicola Galesi z Abstract This paper is concerned with the complexity of proofs and of searching…
- Cited by 40 (4 self) – Add To MetaCart
Showing 1 through 10.
Next 10 →
