To access the full text documents, please follow this link: http://hdl.handle.net/2117/82062
dc.contributor | Universitat Politècnica de Catalunya. Departament de Ciències de la Computació |
---|---|
dc.contributor | Universitat Politècnica de Catalunya. LARCA - Laboratori d'Algorísmia Relacional, Complexitat i Aprenentatge |
dc.contributor.author | Arratia Quesada, Argimiro Alejandro |
dc.contributor.author | Ortiz, Carlos E. |
dc.date | 2004 |
dc.identifier.citation | Arratia, A., Ortiz, C. Approximating the expressive power of logics in finite models. A: Latin American Theoretical Informatics Symposium. "LATIN 2004: theoretical informatics: 6th Latin American Symposium, Buenos Aires, Argentina, April 5-8, 2004: proceedings". Buenos Aires: Springer, 2004, p. 540-556. |
dc.identifier.citation | 978-3-540-21258-4 |
dc.identifier.citation | 10.1007/b95852 |
dc.identifier.uri | http://hdl.handle.net/2117/82062 |
dc.language.iso | eng |
dc.publisher | Springer |
dc.relation | http://link.springer.com/chapter/10.1007/978-3-540-24698-5_57 |
dc.rights | info:eu-repo/semantics/openAccess |
dc.subject | Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica |
dc.subject | Computer algorithms |
dc.subject | Data structures (Computer science) |
dc.subject | theory of computation |
dc.subject | algorithm analysis and problem complexity |
dc.subject | data structures |
dc.subject | computation by abstract devices |
dc.subject | logics and meanings of programs |
dc.subject | numeric computing |
dc.subject | Teoria de la computació |
dc.subject | Algorismes computacionals |
dc.subject | Estructures de dades (Informàtica) |
dc.title | Approximating the expressive power of logics in finite models |
dc.type | info:eu-repo/semantics/submittedVersion |
dc.type | info:eu-repo/semantics/conferenceObject |
dc.description.abstract | |
dc.description.abstract | |
dc.description.abstract |