To access the full text documents, please follow this link: http://hdl.handle.net/2117/95942
dc.contributor | Universitat Politècnica de Catalunya. Departament de Ciències de la Computació |
---|---|
dc.contributor.author | Atserias, Albert |
dc.date | 2000-04 |
dc.identifier.citation | Atserias, A. "The Descriptive complexity of the fixed-points of bounded formulas". 2000. |
dc.identifier.uri | http://hdl.handle.net/2117/95942 |
dc.language.iso | eng |
dc.relation | LSI-00-28-R |
dc.rights | info:eu-repo/semantics/openAccess |
dc.subject | Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica |
dc.subject | Complexity |
dc.subject | Fixed-points |
dc.subject | BIT predicate |
dc.subject | Finite set theory |
dc.subject | Circuit uniformity |
dc.subject | Logarithmic-time hierarchy |
dc.subject | Rudimentary languages |
dc.subject | Integer division |
dc.title | The Descriptive complexity of the fixed-points of bounded formulas |
dc.type | info:eu-repo/semantics/publishedVersion |
dc.type | info:eu-repo/semantics/report |
dc.description.abstract |