SEARCH

SEARCH BY CITATION

References

  • [1]
    G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela and M. Protasi, “Complexity and Approximation – Combinatorial Optimization Problems and their Approximability Properties”, Springer-Verlag, 1999.
  • [2]
    M. Barr and C. Wells “Category Theory for Computing Science”, Prentice Hall, New York, 1990.
  • [3]
    J.-M. Cordier and T. Porter. Shape Theory: Categorical Approximations Methods. Ellis Horwood Ltd, 1990.
  • [4]
    L. A. S. Leal; P. B. Menezes; D. M. Claudio and L. V. Toscani. Optimization Problems Categories. In: Formal Methods and Tools for Computer Science - EUROCAST'2001. Las Palmas de Gran Canaria, Canary Islands, Spain, R.Moreno-Diáz and A.Quesada- Arencibia Eds., 2001. p.93 – 96.
  • [5]
    L. A. S. Leal; P. B. Menezes; D. M. Claudio and L. V. Toscani. Optimization Problems Categories. EUROCAST'01, LNCS 2178. Springer-Verlag, R. Moreno-Diáz, B. Buchberger and J.-L. Freire Eds., 2001. p.285 – 299.
  • [6]
    L. A. S. Leal. Uma fundamentação Teórica para a Complexidade Estrutural de Problemas de Otimização. (PhD Thesis), Universidade Federal do Rio Grande do Sul, Porto Alegre, Brazil, 2002. 115p.
  • [7]
    L. A. S. Leal; D. M. Claudio; P. B. Menezes and L. V. Toscani. Modelling the Approximation Hierarchy to Optimisation Problems Through Category Theory. International Journal of Computing Anticipatory Systems, v. 11, Belgium, 2002. p.336 – 349.
  • [8]
    C. H. Papadimitriou, “Computational Complexity”, Addison-Wesley Publishing Company, 1994.
  • [9]
    C. Rattray. Identification and Recognition Through Shape in Complex Systems. LNCS 1030, Springer-Verlag, 1995. p.19-29.
  • [10]
    C. Rattray. Abstract Modelling Complex Systems. Advances in Computing Science, Systems: Theory and Practice. R. Albrecht, Ed., 1998. pp. 1-12.