From George Boole To John Bell — The Origins of Bell’s Inequality
暂无分享,去创建一个
[1] Mauro Cerasoli,et al. On the probability of a Boolean polynomial of events , 1983, Discret. Math..
[2] David J. Hunter. An upper bound for the probability of a union , 1976, Journal of Applied Probability.
[3] Stanley Gudder,et al. Realistic quantum probability , 1988 .
[4] William Feller,et al. An Introduction to Probability Theory and Its Applications , 1967 .
[5] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[6] A. Fine. Hidden Variables, Joint Probability, and the Bell Inequalities , 1982 .
[7] William Feller,et al. An Introduction to Probability Theory and Its Applications , 1951 .
[8] J J Hopfield,et al. Neural networks and physical systems with emergent collective computational abilities. , 1982, Proceedings of the National Academy of Sciences of the United States of America.
[9] M. Fréchet,et al. Les probabilités associées à un système d'événements compatibles et dépendants , 1940 .
[10] J. A. Todd. The groups of symmetries of the regular polytopes , 1931, Mathematical Proceedings of the Cambridge Philosophical Society.
[11] M. Horne,et al. Experimental Consequences of Objective Local Theories , 1974 .
[12] The Philosophy of Mathematics of Imre Lakatos , 1983 .
[13] M. Garey. Johnson: computers and intractability: a guide to the theory of np- completeness (freeman , 1979 .
[14] Kai Lai Chung,et al. On the Probability of the Occurrence of at Least $m$ Events Among $n$ Arbitrary Events , 1941 .
[15] F. Barahona. On the computational complexity of Ising spin glass models , 1982 .
[16] Stratis Kounias,et al. Best Linear Bonferroni Bounds , 1976 .