Home/Academic Papers/Leituras de plantão/The Complexity of Theorem-Proving Procedures1 / 1ItemThe Complexity of Theorem-Proving Proceduresin Leituras de plantão by Lucas Andrade0likesLike this itemFollow Lucas AndradeOpen in appThe Complexity of Theorem-Proving Procedures on “Leituras de plantão”, a list by Lucas Andrade on TheLysts.DetailsPhoto—Name—ÁreaComplexidade computacionalAno1971Autores principaisStephen A. CookOnde lerProceedings of the Third Annual ACM Symposium on Theory of ComputingMinha reaçãoAqui nasce o famigerado NP-completo. Depois que você entende, nunca mais olha pra um problema difícil sem ouvir boss music.PreviousThe Cathedral and the BazaarNextThe Strength of Weak TiesRelated itemsJAMA - diretrizes de hipertensãoThe International Study of Infarct Survival (ISIS-2) Collaborative Group. Randomized trial of intravenous streptokinase, oral aspirin, both, or neither among 17 187 cases of suspected acute myocardial infarctionDiretriz da AHA sobre Ressuscitação Cardiopulmonar (RCP)Rastreamento que vale a penaReport