Para acceder a los documentos con el texto completo, por favor, siga el siguiente enlace: http://hdl.handle.net/2117/28085
dc.contributor | Universitat Politècnica de Catalunya. Departament de Ciències de la Computació |
---|---|
dc.contributor | Universitat Politècnica de Catalunya. ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals |
dc.contributor.author | Atserias, Albert |
dc.contributor.author | Müller, Moritz |
dc.contributor.author | Oliva Valls, Sergi |
dc.date | 2015-06-01 |
dc.identifier.citation | Atserias, A.; Müller, M.; Oliva, S. Lower bounds for DNF-refutations of a relativized weak pigeonhole principle. "Journal of symbolic logic", 01 Juny 2015, vol. 80, núm. 2, p. 450-476. |
dc.identifier.citation | 0022-4812 |
dc.identifier.citation | 10.1017/jsl.2014.56 |
dc.identifier.uri | http://hdl.handle.net/2117/28085 |
dc.language.iso | eng |
dc.relation | http://journals.cambridge.org/action/displayAbstract?fromPage=online&aid=9664679&fileId=S0022481214000565 |
dc.rights | info:eu-repo/semantics/openAccess |
dc.subject | Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica |
dc.subject | Computational complexity |
dc.subject | Proof complexity |
dc.subject | Bounded arithmetic |
dc.subject | Weak pigeonhole principles |
dc.subject | Approximate counting |
dc.subject | Bounded-depth frege |
dc.subject | Propositional proof systems |
dc.subject | Resolution lower bounds |
dc.subject | Random formulas |
dc.subject | Complexity gap |
dc.subject | Primes |
dc.subject | Size |
dc.subject | Complexitat computacional |
dc.title | Lower bounds for DNF-refutations of a relativized weak pigeonhole principle |
dc.type | info:eu-repo/semantics/publishedVersion |
dc.type | info:eu-repo/semantics/article |
dc.description.abstract | |
dc.description.abstract |