{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,17]],"date-time":"2026-09-17T00:55:56Z","timestamp":1789606556704,"version":"build-2803163510"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642544224","type":"print"},{"value":"9783642544231","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-642-54423-1_3","type":"book-chapter","created":{"date-parts":[[2014,3,24]],"date-time":"2014-03-24T23:02:27Z","timestamp":1395702147000},"page":"24-34","source":"Crossref","is-referenced-by-count":8,"title":["The Computational Complexity of the Game of Set and Its Theoretical Applications"],"prefix":"10.1007","author":[{"given":"Michael","family":"Lampis","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Valia","family":"Mitsou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"3","key":"3_CR1","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/0168-0072(94)00034-Z","volume":"73","author":"K.R. Abrahamson","year":"1995","unstructured":"Abrahamson, K.R., Downey, R.G., Fellows, M.R.: Fixed-Parameter Tractability and Completeness IV: On Completeness for W[P] and PSPACE Analogues. Ann. Pure Appl. Logic\u00a073(3), 235\u2013276 (1995)","journal-title":"Ann. Pure Appl. Logic"},{"key":"3_CR2","unstructured":"Chaudhuri, K., Godfrey, B., Ratajczak, D., Wee, H.: On the Complexity of the Game of Set (2003) (manuscript)"},{"issue":"23","key":"3_CR3","doi-asserted-by":"publisher","first-page":"2503","DOI":"10.1016\/j.tcs.2010.10.042","volume":"412","author":"J. Chen","year":"2011","unstructured":"Chen, J., Feng, Q., Liu, Y., Lu, S., Wang, J.: Improved Deterministic Algorithms for Weighted Matching and Packing Problems. Theor. Comput. Sci.\u00a0412(23), 2503\u20132512 (2011)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"3_CR4","doi-asserted-by":"publisher","first-page":"83","DOI":"10.4169\/math.mag.85.2.083","volume":"85","author":"B. Coleman","year":"2012","unstructured":"Coleman, B., Hartshorn, K.: Game, Set, Math. Mathematics Magazine\u00a085(2), 83\u201396 (2012)","journal-title":"Mathematics Magazine"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Davis, B.L., Davis, Maclagan, D.: The Card Game Set (2003)","DOI":"10.1007\/BF02984846"},{"issue":"1","key":"3_CR6","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.tcs.2008.09.065","volume":"410","author":"M.R. Fellows","year":"2009","unstructured":"Fellows, M.R., Hermelin, D., Rosamond, F.A., Vialette, S.: On the Parameterized Complexity of Multiple-interval Graph Problems. Theor. Comput. Sci.\u00a0410(1), 53\u201361 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"3_CR7","volume-title":"Computers and Intractability","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability, vol.\u00a0174. Freeman, New York (1979)"},{"key":"3_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1007\/978-3-642-39206-1_42","volume-title":"Automata, Languages, and Programming","author":"D. Grier","year":"2013","unstructured":"Grier, D.: Deciding the Winner of an Arbitrary Finite Poset Game Is PSPACE-Complete. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds.) ICALP 2013, Part I. LNCS, vol.\u00a07965, pp. 497\u2013503. Springer, Heidelberg (2013)"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Lampis, M., Mitsou, V.: The Computational Complexity of the Game of Set and its Theoretical Applications. arXiv preprint arXiv:1309.6504 (2013)","DOI":"10.1007\/978-3-642-54423-1_3"},{"key":"3_CR10","volume-title":"Computational Complexity","author":"C.M. Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.M.: Computational Complexity. Addison-Wesley, Reading (1994)"},{"issue":"2","key":"3_CR11","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/0022-0000(78)90045-4","volume":"16","author":"T.J. Schaefer","year":"1978","unstructured":"Schaefer, T.J.: On the Complexity of Some Two-Person Perfect-Information Games. J. Comput. Syst. Sci.\u00a016(2), 185\u2013225 (1978)","journal-title":"J. Comput. Syst. Sci."},{"key":"3_CR12","unstructured":"Wahlstr\u00f6m, M.: Algorithms, measures and upper bounds for satisfiability and related problems. PhD thesis, Link\u00f6ping (2007)"},{"key":"3_CR13","unstructured":"Zabrocki, M.: The joy of set (2001)"}],"container-title":["Lecture Notes in Computer Science","LATIN 2014: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-54423-1_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T08:37:07Z","timestamp":1558859827000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-54423-1_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642544224","9783642544231"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-54423-1_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}