{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:14:08Z","timestamp":1725664448370},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540587156"},{"type":"electronic","value":"9783540490548"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58715-2_112","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T11:41:48Z","timestamp":1330256508000},"page":"36-47","source":"Crossref","is-referenced-by-count":7,"title":["The complexity of computing over quasigroups"],"prefix":"10.1007","author":[{"given":"Herv\u00e9","family":"Caussinus","sequence":"first","affiliation":[]},{"given":"Fran\u00e7ois","family":"Lemieux","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1090\/S0002-9947-1943-0009962-7","volume":"54","author":"A.A. Albert","year":"1943","unstructured":"A.A. Albert, Quasigroups. I, Trans. Amer. Math. Soc., Vol. 54 (1943) pp.507\u2013519.","journal-title":"Trans. Amer. Math. Soc."},{"key":"4_CR2","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1090\/S0002-9947-1944-0010597-1","volume":"55","author":"A.A. Albert","year":"1944","unstructured":"A.A. Albert, Quasigroups. II, Trans. Amer. Math. Soc., Vol. 55 (1944) pp.401\u2013419.","journal-title":"Trans. Amer. Math. Soc."},{"issue":"1","key":"4_CR3","first-page":"150","volume":"38","author":"D.A. Barrington","year":"1989","unstructured":"D.A. Barrington, Bounded-Width Polynomial-Size Branching Programs Recognize Exactly Those Languages in NC1, JCSS 38, 1 (1989), pp. 150\u2013164.","journal-title":"JCSS"},{"key":"4_CR4","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/0890-5401(90)90007-5","volume":"89","author":"D.A. Barrington","year":"1990","unstructured":"D.A. Barrington H. Straubing and D. Th\u00e9rien, Non-Uniform Automata Over Groups, Information and Computation 89 (1990), pp. 109\u2013132.","journal-title":"Information and Computation"},{"issue":"4","key":"4_CR5","doi-asserted-by":"crossref","first-page":"941","DOI":"10.1145\/48014.63138","volume":"35","author":"D. Barrington","year":"1988","unstructured":"D. Barrington and D. Th\u00e9rien, Finite Monoids and the Fine Structure of NC 1, JACM 35, 4 (1988), pp. 941\u2013952.","journal-title":"JACM"},{"doi-asserted-by":"crossref","unstructured":"M. Beaudry and P. McKenzie, Circuits, Matrices and Nonassociative Computation, Proc. of the 7th Structure in Complexity Theory Conference, (1992), pp. 94\u2013106.","key":"4_CR6","DOI":"10.1109\/SCT.1992.215384"},{"key":"4_CR7","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/0304-3975(93)90253-P","volume":"107","author":"F. B\u00e9dard","year":"1993","unstructured":"F. B\u00e9dard, F. Lemieux and P. McKenzie, Extensions to Barrington's M-program model, TCS 107 (1993), pp. 31\u201361.","journal-title":"TCS"},{"key":"4_CR8","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1090\/S0002-9947-1946-0017288-3","volume":"60","author":"R.H. Bruck","year":"1946","unstructured":"R.H. Bruck, Contributions to the Theory of Loops, Trans. AMS, (60) 1946 pp.245\u2013354.","journal-title":"Trans. AMS"},{"unstructured":"R.H. Bruck, A Survey of Binary Systems, Springer-Verlag, 1966.","key":"4_CR9"},{"doi-asserted-by":"crossref","unstructured":"S.R. Buss, The Boolean Formula Value Problem is in ALOGTIME, Proc. of the 19th ACM Symp. on the Theory of Computing (1987), pp. 123\u2013131.","key":"4_CR10","DOI":"10.1145\/28395.28409"},{"doi-asserted-by":"crossref","unstructured":"A.K. Chandra, S. Fortune and R. Lipton, Unbounded Fan-in Circuits and Associative Functions, Proc. of the 15th ACM Symp. on the Theory of Computing (1983), pp. 52\u201360.","key":"4_CR11","DOI":"10.1145\/800061.808732"},{"key":"4_CR12","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/S0019-9958(85)80041-3","volume":"64","author":"S.A. Cook","year":"1985","unstructured":"S.A. Cook, A Taxonomy of Problems with Fast Parallel Algorithms, Information and Control 64 (1985), pp. 2\u201322.","journal-title":"Information and Control"},{"unstructured":"J. D\u00e9nes and A.D. Keedwell, Latin Squares and their Applications, English University Press, 1974.","key":"4_CR13"},{"key":"4_CR14","doi-asserted-by":"crossref","first-page":"552","DOI":"10.1090\/S0002-9939-1965-0175971-0","volume":"16","author":"W.D. Maurer","year":"1965","unstructured":"W.D. Maurer and J. Rhodes, A Property of Finite Simple Non-abelian Groups, Proc. AMS 16 (1965), 552\u2013554.","journal-title":"Proc. AMS"},{"unstructured":"G.L. Miller, On the n log n Isomorphic Technique, Proc. of the 10th ACM Symp. on the Theory of Computing (1978), pp. 51\u201358.","key":"4_CR15"},{"unstructured":"A. Muscholl, Characterizations of LOG, LOGDCFL and NP based on groupoid programs, Manuscript, 1992.","key":"4_CR16"},{"unstructured":"H.O. Pfugfelder, Quasigroups and Loops: Introduction, Heldermann Verlag, 1990.","key":"4_CR17"},{"doi-asserted-by":"crossref","unstructured":"J.-E. Pin, Vari\u00e9t\u00e9s de languages formels, Masson, 1984. Also Varieties of Formal Languages, Plenum Press, New York, 1986.","key":"4_CR18","DOI":"10.1007\/978-1-4613-2215-3"},{"key":"4_CR19","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1016\/S0019-9958(65)90108-7","volume":"8","author":"M.P. Sch\u00fctzenberger","year":"1965","unstructured":"M.P. Sch\u00fctzenberger, On Finite Monoids having only trivial subgroups, Information and Control 8 (1965), pp. 190\u2013194.","journal-title":"Information and Control"},{"unstructured":"H. Straubing, Representing Functions by Words over Finite Semigroups, Universit\u00e9 de Montr\u00e9al, Technical Report #838, 1992.","key":"4_CR20"},{"key":"4_CR21","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/0304-3975(81)90057-8","volume":"14","author":"D. Th\u00e9rien","year":"1981","unstructured":"D. Th\u00e9rien, Classification of Finite Monoids: The Language Approach, TCS 14 (1981), pp. 195\u2013208.","journal-title":"TCS"},{"doi-asserted-by":"crossref","unstructured":"H. Venkateswaran, Properties that Characterize LOGCFL, Proc. of the 19th ACM Symp. on the Theory of Computing (1987), pp. 141\u2013150.","key":"4_CR22","DOI":"10.1145\/28395.28411"},{"key":"4_CR23","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/0304-3975(92)00014-I","volume":"125","author":"M.J. Wolf","year":"1994","unstructured":"M.J. Wolf, Nondeterministic Circuits, Space Complexity and Quasigroups, TCS 125 (1994), pp. 295\u2013314.","journal-title":"TCS"}],"container-title":["Lecture Notes in Computer Science","Foundation of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58715-2_112.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:23:39Z","timestamp":1605630219000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58715-2_112"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540587156","9783540490548"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/3-540-58715-2_112","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}