Probabilistic analysis of optimal algorithms for three NP-hard problems (1988)
Unidade: IMEAssunto: COMPUTABILIDADE E COMPLEXIDADE
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
TERADA, Routo. Probabilistic analysis of optimal algorithms for three NP-hard problems. . São Paulo: IME-USP. Disponível em: https://repositorio.usp.br/directbitstream/00917237-faca-4a83-8c8c-1bd91a8e6d0a/781446.pdf. Acesso em: 27 nov. 2025. , 1988APA
Terada, R. (1988). Probabilistic analysis of optimal algorithms for three NP-hard problems. São Paulo: IME-USP. Recuperado de https://repositorio.usp.br/directbitstream/00917237-faca-4a83-8c8c-1bd91a8e6d0a/781446.pdfNLM
Terada R. Probabilistic analysis of optimal algorithms for three NP-hard problems [Internet]. 1988 ;[citado 2025 nov. 27 ] Available from: https://repositorio.usp.br/directbitstream/00917237-faca-4a83-8c8c-1bd91a8e6d0a/781446.pdfVancouver
Terada R. Probabilistic analysis of optimal algorithms for three NP-hard problems [Internet]. 1988 ;[citado 2025 nov. 27 ] Available from: https://repositorio.usp.br/directbitstream/00917237-faca-4a83-8c8c-1bd91a8e6d0a/781446.pdf
