To access the full text documents, please follow this link: http://hdl.handle.net/2117/26697
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 | Dawar, Anuj |
dc.date | 2014-02-01 |
dc.identifier.citation | Atserias, A.; Dawar, A. Degree lower bounds of tower-type for approximating formulas with parity quantifiers. "ACM transactions on computational logic", 01 Febrer 2014, vol. 15, núm. 1. |
dc.identifier.citation | 1529-3785 |
dc.identifier.citation | 10.1145/2559948 |
dc.identifier.uri | http://hdl.handle.net/2117/26697 |
dc.language.iso | eng |
dc.relation | http://dl.acm.org/citation.cfm?id=2559948&CFID=316295191&CFTOKEN=11341755 |
dc.rights | info:eu-repo/semantics/openAccess |
dc.subject | Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica |
dc.subject | Graph theory |
dc.subject | Polynomials |
dc.subject | Algorithms |
dc.subject | Theory |
dc.subject | Canonical labeling algorithm |
dc.subject | Convergence laws |
dc.subject | Gowers uniformity norm |
dc.subject | Logic |
dc.subject | Parity quantifiers |
dc.subject | Random graphs |
dc.subject | Graphs |
dc.subject | Grafs, Teoria de |
dc.subject | Polinomis |
dc.title | Degree lower bounds of tower-type for approximating formulas with parity quantifiers |
dc.type | info:eu-repo/semantics/submittedVersion |
dc.type | info:eu-repo/semantics/article |
dc.description.abstract |