The Complexity of Theorem-Proving Procedures, image 1 of 11 / 1
Item

The Complexity of Theorem-Proving Procedures

in Leituras de plantão by Lucas Andrade

Like this itemFollow Lucas AndradeOpen in app

The Complexity of Theorem-Proving Procedures on “Leituras de plantão”, a list by Lucas Andrade on TheLysts.

Details

Photo
—
Name
—
Área
Complexidade computacional
Ano
1971
Autores principais
Stephen A. Cook
Onde ler
Proceedings of the Third Annual ACM Symposium on Theory of Computing
Minha reação
Aqui nasce o famigerado NP-completo. Depois que você entende, nunca mais olha pra um problema difícil sem ouvir boss music.

Related items

Revisiting The HallmarksThe CRASH-2 trial collaborators. Effects of tranexamic acid on death, vascular occlusive events, and blood transfusion in trauma patientsRivers E. Early goal-directed therapy in the treatment of severe sepsis and septic shockGlobal Burden of Disease 2019