{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T13:30:53Z","timestamp":1780493453988,"version":"3.54.1"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662445211","type":"print"},{"value":"9783662445228","type":"electronic"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-44522-8_5","type":"book-chapter","created":{"date-parts":[[2014,8,12]],"date-time":"2014-08-12T10:12:23Z","timestamp":1407838343000},"page":"50-62","source":"Crossref","is-referenced-by-count":9,"title":["Choiceless Polynomial Time on Structures with Small Abelian Colour Classes"],"prefix":"10.1007","author":[{"given":"F.","family":"Abu Zaid","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"E.","family":"Gr\u00e4del","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"M.","family":"Grohe","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"W.","family":"Pakusa","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Anderson, M., Dawar, A., Holm, B.: Maximum matching and linear programming in fixed-point logic with counting. In: LICS 2013, pp. 173\u2013182 (2013)","DOI":"10.1109\/LICS.2013.23"},{"issue":"18","key":"5_CR2","doi-asserted-by":"publisher","first-page":"1666","DOI":"10.1016\/j.tcs.2008.12.049","volume":"410","author":"A. Atserias","year":"2009","unstructured":"Atserias, A., Bulatov, A., Dawar, A.: Affine systems of equations and counting infinitary logic. Theoretical Computer Science\u00a0410(18), 1666\u20131683 (2009)","journal-title":"Theoretical Computer Science"},{"key":"5_CR3","unstructured":"Babai, L.: Monte-Carlo algorithms in graph isomorphism testing. Universit\u00e9 de Montr\u00e9al Technical Report, DMS, pp. 79\u201310 (1979)"},{"issue":"1","key":"5_CR4","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/S0168-0072(99)00005-6","volume":"100","author":"A. Blass","year":"1999","unstructured":"Blass, A., Gurevich, Y., Shelah, S.: Choiceless polynomial time. Annals of Pure and Applied Logic\u00a0100(1), 141\u2013187 (1999)","journal-title":"Annals of Pure and Applied Logic"},{"issue":"3","key":"5_CR5","doi-asserted-by":"publisher","first-page":"1093","DOI":"10.2178\/jsl\/1190150152","volume":"67","author":"A. Blass","year":"2002","unstructured":"Blass, A., Gurevich, Y., Shelah, S.: On polynomial time computation over unordered structures. Journal of Symbolic Logic\u00a067(3), 1093\u20131125 (2002)","journal-title":"Journal of Symbolic Logic"},{"issue":"4","key":"5_CR6","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/BF01305232","volume":"12","author":"J. Cai","year":"1992","unstructured":"Cai, J., F\u00fcrer, M., Immerman, N.: An optimal lower bound on the number of variables for graph identification. Combinatorica\u00a012(4), 389\u2013410 (1992)","journal-title":"Combinatorica"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Dawar, A., Grohe, M., Holm, B., Laubner, B.: Logics with rank operators. In: LICS 2009, pp. 113\u2013122 (2009)","DOI":"10.1109\/LICS.2009.24"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Dawar, A., Gr\u00e4del, E., Holm, B., Kopczynski, E., Pakusa, W.: Definability of linear equation systems over groups and rings. LMCS\u00a09(4) (2013)","DOI":"10.2168\/LMCS-9(4:12)2013"},{"issue":"1-3","key":"5_CR9","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.apal.2007.11.011","volume":"152","author":"A. Dawar","year":"2008","unstructured":"Dawar, A., Richerby, D., Rossman, B.: Choiceless polynomial time, counting and the Cai\u2013F\u00fcrer\u2013Immerman graphs. Annals of Pure and Applied Logic\u00a0152(1-3), 31\u201350 (2008)","journal-title":"Annals of Pure and Applied Logic"},{"key":"5_CR10","unstructured":"Gr\u00e4del, E., et al.: Finite Model Theory and its Applications. Springer (2007)"},{"key":"5_CR11","unstructured":"Furst, M., Hopcroft, J.E., Luks, E.: A subexponential algorithm for trivalent graph isomorphism. Technical report (1980)"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Grohe, M.: The quest for a logic capturing PTIME. In: LICS 2008, pp. 267\u2013271 (2008)","DOI":"10.1109\/LICS.2008.11"},{"issue":"5","key":"5_CR13","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1145\/2371656.2371662","volume":"59","author":"M. Grohe","year":"2012","unstructured":"Grohe, M.: Fixed-point definability and polynomial time on graphs with excluded minors. Journal of the ACM (JACM)\u00a059(5), 27 (2012)","journal-title":"Journal of the ACM (JACM)"},{"key":"5_CR14","unstructured":"Hall, M.: The theory of groups. American Mathematical Soc. (1976)"},{"key":"5_CR15","unstructured":"Holm, B.: Descriptive complexity of linear algebra. PhD thesis, University of Cambridge (2010)"},{"issue":"1","key":"5_CR16","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/0022-0000(82)90009-5","volume":"25","author":"E.M. Luks","year":"1982","unstructured":"Luks, E.M.: Isomorphism of graphs of bounded valence can be tested in polynomial time. Journal of Computer and System Sciences\u00a025(1), 42\u201365 (1982)","journal-title":"Journal of Computer and System Sciences"},{"key":"5_CR17","doi-asserted-by":"crossref","unstructured":"Rossman, B.: Choiceless computation and symmetry. In: Blass, A., Dershowitz, N., Reisig, W. (eds.) Gurevich Festschrift. LNCS, vol.\u00a06300, pp. 565\u2013580. Springer, Heidelberg (2010)","DOI":"10.1007\/978-3-642-15025-8_28"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2014"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44522-8_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,12]],"date-time":"2024-07-12T09:04:31Z","timestamp":1720775071000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-44522-8_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662445211","9783662445228"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44522-8_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}