A Solution of the Shannon Switching Game
1964; Society for Industrial and Applied Mathematics; Volume: 12; Issue: 4 Linguagem: Inglês
10.1137/0112059
ISSN2168-3484
Autores Tópico(s)Logic, programming, and type systems
ResumoNext article A Solution of the Shannon Switching GameAlfred LehmanAlfred Lehmanhttps://doi.org/10.1137/0112059PDFBibTexSections ToolsAdd to favoritesExport CitationTrack CitationsEmail SectionsAbout[1] Garrett Birkhoff, Abstract Linear Dependence and Lattices, Amer. J. Math., 57 (1935), 800–804 MR1507113 0013.00104 CrossrefGoogle Scholar[2] M. Gardner, Mathematical games, Scientific American, 197 (1957), 145–148, July 1957, August 1957, p. 129, October 1957, p. 138 CrossrefGoogle Scholar[3] M. Gardner, Mathematical games, Scientific American, 199 (1958), 124 and 129, October 1958, vol. 205, July 1961, pp. 150 and 152 CrossrefGoogle Scholar[4] A. Lehman, A solution to the Shannon switching game, Notices Amer. Math. Soc., 8 (1961), 239–240, (abstract) Google Scholar[5] A. Lehman, A solution to the Shannon switching game, Proc. I. R. E., 49 (1961), 1339–, (correspondence) ISIGoogle Scholar[6] Saunders Mac Lane, A lattice formulation for transcendence degrees and p-bases, Duke Math. J., 4 (1938), 455–468 10.1215/S0012-7094-38-00438-7 MR1546067 CrossrefGoogle Scholar[7] Marvin Minsky, Steps toward artificial intelligence, Proc. IRE, 49 (1961), 8–30 MR0134428 CrossrefISIGoogle Scholar Next article FiguresRelatedReferencesCited byDetails Clean Clutters and Dyadic Fractional PackingsAhmad Abdi, Gérard Cornuéjols, Bertrand Guenin, and Levent Tunçel19 April 2022 | SIAM Journal on Discrete Mathematics, Vol. 36, No. 2AbstractPDF (924 KB)Delta Minors, Delta Free Clutters, and EntanglementAhmad Abdi and Kanstantsin Pashkovich24 July 2018 | SIAM Journal on Discrete Mathematics, Vol. 32, No. 3AbstractPDF (465 KB)Single Commodity-Flow Algorithms for Lifts of Graphic and CoGraphic MatroidsBertrand Guenin and Leanne Stuive8 September 2016 | SIAM Journal on Discrete Mathematics, Vol. 30, No. 3AbstractPDF (554 KB)Lehman's Theorem and the Directed Steiner Tree ProblemAhmad Abdi, Andreas Emil Feldmann, Bertrand Guenin, Jochen Könemann, and Laura Sanità14 January 2016 | SIAM Journal on Discrete Mathematics, Vol. 30, No. 1AbstractPDF (318 KB)Planarity, Colorability, and Minor GamesDan Hefetz, Michael Krivelevich, Miloš Stojaković, and Tibor Szabó20 February 2008 | SIAM Journal on Discrete Mathematics, Vol. 22, No. 1AbstractPDF (228 KB)On the Complexity of Some Enumeration Problems for MatroidsL. Khachiyan, E. Boros, K. Elbassioni, V. Gurvich, and K. Makino1 August 2006 | SIAM Journal on Discrete Mathematics, Vol. 19, No. 4AbstractPDF (244 KB)Ideal Binary Clutters, Connectivity, and a Conjecture of SeymourGérard Cornuéjols and Bertrand Guenin1 August 2006 | SIAM Journal on Discrete Mathematics, Vol. 15, No. 3AbstractPDF (276 KB)On Four Problems in Graph TheoryEllis L. Johnson and Sebastiano Mosterts17 July 2006 | SIAM Journal on Algebraic Discrete Methods, Vol. 8, No. 2AbstractPDF (2689 KB)Disjoint Representation of Tree Realizable SequencesSukhamay Kundu12 July 2006 | SIAM Journal on Applied Mathematics, Vol. 26, No. 1AbstractPDF (450 KB) Volume 12, Issue 4| 1964Journal of the Society for Industrial and Applied Mathematics History Submitted:02 October 1962Published online:13 July 2006 InformationCopyright © 1964 Society for Industrial and Applied MathematicsPDF Download Article & Publication DataArticle DOI:10.1137/0112059Article page range:pp. 687-725ISSN (print):0368-4245ISSN (online):2168-3484Publisher:Society for Industrial and Applied Mathematics
Referência(s)