Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Galesi, Nicola - Dipartimento di Informatica, Università di Roma "La Sapienza"
Space Complexity of Random Formulae in Resolution Eli BenSasson \Lambda
Degree Complexity for a Modified Pigeonhole Principle \Lambda Maria Luisa Bonet y
Theory Comput Syst DOI 10.1007/s00224-009-9195-5
A syntactic characterization of boundedrank decision trees in terms of decision lists \Lambda
THEORY OF COMPUTING, Volume 2 (2006), pp. 6590 http://theoryofcomputing.org
Optimality of size-degree trade-offs for Polynomial NICOLA GALESI and MASSIMO LAURIA
Paris-Harrington tautologies Lorenzo Carlucci, Nicola Galesi and Massimo Lauria
Monotone Simulations of Nonmonotone Proofs Albert Atserias \Lambda
Polynomial time SAT decision, hypergraph transversals and the Hermitian rank
Linear lower bounds and simulations in Frege systems with substitutions ?
