Complexity-oriented analysis of programming implementation: bicriterion case (1991)
Unidade: IMEAssunto: PROGRAMAÇÃO DINÂMICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
HUMES JÚNIOR, Carlos e WASSERSTEIN, Sergio Luis e ZANJACOMO, Paulo Regis. Complexity-oriented analysis of programming implementation: bicriterion case. . São Paulo: IME-USP. Disponível em: https://repositorio.usp.br/directbitstream/db5275f5-63ad-426d-8c6e-42563defadf0/813018.pdf. Acesso em: 06 out. 2024. , 1991APA
Humes Júnior, C., Wasserstein, S. L., & Zanjacomo, P. R. (1991). Complexity-oriented analysis of programming implementation: bicriterion case. São Paulo: IME-USP. Recuperado de https://repositorio.usp.br/directbitstream/db5275f5-63ad-426d-8c6e-42563defadf0/813018.pdfNLM
Humes Júnior C, Wasserstein SL, Zanjacomo PR. Complexity-oriented analysis of programming implementation: bicriterion case [Internet]. 1991 ;[citado 2024 out. 06 ] Available from: https://repositorio.usp.br/directbitstream/db5275f5-63ad-426d-8c6e-42563defadf0/813018.pdfVancouver
Humes Júnior C, Wasserstein SL, Zanjacomo PR. Complexity-oriented analysis of programming implementation: bicriterion case [Internet]. 1991 ;[citado 2024 out. 06 ] Available from: https://repositorio.usp.br/directbitstream/db5275f5-63ad-426d-8c6e-42563defadf0/813018.pdf