Contents 1 Introduction 3 2 Orthomodular quantum logic and orthologic 11 3 The implication problem 22 4 Metalogical properties and anomalies 28 5 A modal interpretation of OL and OQL 32 6 An axiomatization of OL and OQL 35 7 The intractability of or
Organisation pratique du cours : R´ef´erences • Introduction `a la calculabilit´e, Pierre Wolper, InterEditions, 1991. • Computational Complexity, Christos H. Papadimitriou, Addison Wesley, 1994. • Computers and Intractability - A Guide to the Theor
（为.djvu文件，可用WinDjView 打开） COMPUTERS AND INTRACTABILITY： A Guide to the Theory of NP-Completeness by Michael R. Garey & David S. Johnson Content 1 Computers, Complexity, and Intractability 1 1.1 Introduction 1 1.2 Problems, Algorithms, and Complexity
Few technical terms have gained such rapid notoriety as the appela- tion HNP-complete." In the short time since its introduction in the early 1970's, this term has come to symbolize the abyss of inherent intractability that algorithm designers incre
The Bayesian method is the natural approach to inference, yet it is hidden from readers behind chapters of slow, mathematical analysis. The typical text on Bayesian inference involves two to three chapters on probability theory, then enters what Bay
