Probabilistic satisfiability: algorithms with the presence and absence of a phase transition (2015)
Finger, Marcelo 
; De Bona, Glauber
Source: Annals of Mathematics and Artificial Intelligence. Unidade: IME
Subjects: INTELIGÊNCIA ARTIFICIAL, RACIOCÍNIO PROBABILÍSTICO, REPRESENTAÇÃO DE CONHECIMENTO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FINGER, Marcelo e DE BONA, Glauber. Probabilistic satisfiability: algorithms with the presence and absence of a phase transition. Annals of Mathematics and Artificial Intelligence, v. 75, n. 3-4, p. 351-389, 2015Tradução . . Disponível em: https://doi.org/10.1007/s10472-015-9466-6. Acesso em: 05 jan. 2026.APA
Finger, M., & De Bona, G. (2015). Probabilistic satisfiability: algorithms with the presence and absence of a phase transition. Annals of Mathematics and Artificial Intelligence, 75( 3-4), 351-389. doi:10.1007/s10472-015-9466-6NLM
Finger M, De Bona G. Probabilistic satisfiability: algorithms with the presence and absence of a phase transition [Internet]. Annals of Mathematics and Artificial Intelligence. 2015 ; 75( 3-4): 351-389.[citado 2026 jan. 05 ] Available from: https://doi.org/10.1007/s10472-015-9466-6Vancouver
Finger M, De Bona G. Probabilistic satisfiability: algorithms with the presence and absence of a phase transition [Internet]. Annals of Mathematics and Artificial Intelligence. 2015 ; 75( 3-4): 351-389.[citado 2026 jan. 05 ] Available from: https://doi.org/10.1007/s10472-015-9466-6
