{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T11:12:49Z","timestamp":1778497969713,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642258695","type":"print"},{"value":"9783642258701","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-25870-1_4","type":"book-chapter","created":{"date-parts":[[2011,11,30]],"date-time":"2011-11-30T08:32:45Z","timestamp":1322641965000},"page":"23-34","source":"Crossref","is-referenced-by-count":10,"title":["On Searching for Small Kochen-Specker Vector Systems"],"prefix":"10.1007","author":[{"given":"Felix","family":"Arends","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jo\u00ebl","family":"Ouaknine","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Charles W.","family":"Wampler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4_CR1","unstructured":"Arends, F.: A lower bound on the size of the smallest Kochen-Specker vector system. Master\u2019s thesis. Oxford University (2009), www.cs.ox.ac.uk\/people\/joel.ouaknine\/download\/arends09.pdf"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Arends, F., Ouaknine, J., Wampler, C.W.: On searching for small Kochen-Specker vector systems (extended version). Technical report (2011), www.cs.ox.ac.uk\/people\/joel.ouaknine\/publications\/ks11abs.html","DOI":"10.1007\/978-3-642-25870-1_4"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Babai, L., Luks, E.M.: Canonical labeling of graphs. In: Proc. STOC. ACM (1983)","DOI":"10.1145\/800061.808746"},{"key":"4_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-33099-2","volume-title":"Algorithms in Real Algebraic Geometry","author":"S. Basu","year":"2006","unstructured":"Basu, S., Pollack, R., Roy, M.-F.: Algorithms in Real Algebraic Geometry. Springer, Heidelberg (2006)"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Beineke, L.W., Wilson, R.J. (eds.): Topics in Topological Graph Theory. Encyclopedia of Mathematics and its Applications. Cambridge University Press (2009)","DOI":"10.1017\/CBO9781139087223"},{"key":"4_CR6","unstructured":"http:\/\/www.nd.edu\/~sommese\/bertini\/"},{"key":"4_CR7","doi-asserted-by":"publisher","first-page":"787","DOI":"10.1007\/BF02058633","volume":"26","author":"J. Bub","year":"1996","unstructured":"Bub, J.: Sch\u00fctte\u2019s tautology and the Kochen-Specker theorem. Found. Phys.\u00a026, 787\u2013806 (1996)","journal-title":"Found. Phys."},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Canny, J.: Some algebraic and geometric computations in PSPACE. In: Proc. STOC. ACM (1988)","DOI":"10.1145\/62212.62257"},{"key":"4_CR9","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1080\/00207167908803169","volume":"7","author":"C.J. Colbourn","year":"1979","unstructured":"Colbourn, C.J., Read, R.C.: Orderly algorithms for graph generation. Int. J. Comput. Math.\u00a07, 167\u2013172 (1979)","journal-title":"Int. J. Comput. Math."},{"issue":"10","key":"4_CR10","doi-asserted-by":"publisher","first-page":"1441","DOI":"10.1007\/s10701-006-9068-6","volume":"36","author":"J.H. Conway","year":"2006","unstructured":"Conway, J.H., Kochen, S.: The free will theorem. Found. Phys.\u00a036(10), 1441\u20131473 (2006)","journal-title":"Found. Phys."},{"key":"4_CR11","unstructured":"Conway, J.H., Kochen, S.: The strong free will theorem. Notices of the AMS\u00a056(2) (2009)"},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"Huang, Y.-F., Li, C.-F., Zhang, Y.-S., Pan, J.-W., Guo, G.-C.: Experimental test of the Kochen-Specker theorem with single photons. Phys. Rev. Lett.\u00a090(250401) (2003)","DOI":"10.1103\/PhysRevLett.90.250401"},{"key":"4_CR13","first-page":"235","volume":"17","author":"S. Kochen","year":"1967","unstructured":"Kochen, S., Specker, E.P.: The problem of hidden variables in quantum mechanics. J. Math. Mech.\u00a017, 235\u2013263 (1967)","journal-title":"J. Math. Mech."},{"key":"4_CR14","doi-asserted-by":"publisher","first-page":"799","DOI":"10.1209\/epl\/i2002-00444-0","volume":"58","author":"J.-\u00c5. Larsson","year":"2002","unstructured":"Larsson, J.-\u00c5.: A Kochen-Specker inequality. Europhys. Lett.\u00a058, 799\u2013805 (2002)","journal-title":"Europhys. Lett."},{"key":"4_CR15","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1006\/jagm.1997.0898","volume":"26","author":"B.D. McKay","year":"1998","unstructured":"McKay, B.D.: Isomorph-free exhaustive generation. J. Alg.\u00a026, 306\u2013324 (1998)","journal-title":"J. Alg."},{"key":"4_CR16","unstructured":"http:\/\/www.minisat.se\/"},{"issue":"7","key":"4_CR17","doi-asserted-by":"publisher","first-page":"1577","DOI":"10.1088\/0305-4470\/38\/7\/013","volume":"38","author":"M. Pavi\u010di\u0107","year":"2005","unstructured":"Pavi\u010di\u0107, M., Merlet, J.-P., McKay, B., Megill, N.D.: Kochen-Specker vectors. J. Phys. A: Math. Gen.\u00a038(7), 1577\u20131592 (2005)","journal-title":"J. Phys. A: Math. Gen."},{"key":"4_CR18","unstructured":"Pavi\u010di\u0107, M., Merlet, J.-P., Megill, N.D.: Exhaustive enumeration of Kochen-Specker vector systems. Research report RR-5388, INRIA (2004)"},{"key":"4_CR19","doi-asserted-by":"crossref","unstructured":"Peres, A.: Two simple proofs of the Kochen-Specker theorem. J. Phys. A: Math. Gen.\u00a024, L175\u2013L178 (1991)","DOI":"10.1088\/0305-4470\/24\/4\/003"},{"key":"4_CR20","unstructured":"Peres, A.: Quantum Theory: Concepts and Methods. Kluwer (1993)"},{"key":"4_CR21","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/S0167-5060(08)70325-X","volume":"2","author":"R.C. Read","year":"1978","unstructured":"Read, R.C.: Every one a winner, or: How to avoid isomorphism search when cataloguing combinatorial configurations. Annals Discrete Math.\u00a02, 107\u2013120 (1978)","journal-title":"Annals Discrete Math."},{"key":"4_CR22","series-title":"Lecture Notes in Mathematics","volume-title":"A survey of graph generation techniques","author":"R.C. Read","year":"1981","unstructured":"Read, R.C.: A survey of graph generation techniques. Lecture Notes in Mathematics, vol.\u00a0884. Springer, Heidelberg (1981)"},{"issue":"3","key":"4_CR23","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/S0747-7171(10)80003-3","volume":"13","author":"J. Renegar","year":"1992","unstructured":"Renegar, J.: On the computational complexity and geometry of the first-order theory of the reals. Parts I-III. J. Symb. Comput.\u00a013(3), 255\u2013352 (1992)","journal-title":"J. Symb. Comput."},{"key":"4_CR24","unstructured":"Sloane, N.J.A.: The On-Line Encyclopedia of Integer Sequences (2010), http:\/\/www.research.att.com\/~njas\/sequences\/"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25870-1_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,20]],"date-time":"2019-06-20T00:04:58Z","timestamp":1560989098000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25870-1_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642258695","9783642258701"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25870-1_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}