{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,12,19]],"date-time":"2024-12-19T05:30:02Z","timestamp":1734586202550,"version":"3.30.2"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[1986,11,1]],"date-time":"1986-11-01T00:00:00Z","timestamp":531187200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[1986,11]]},"DOI":"10.1007\/bf00264315","type":"journal-article","created":{"date-parts":[[2004,9,29]],"date-time":"2004-09-29T06:07:21Z","timestamp":1096438041000},"page":"697-705","source":"Crossref","is-referenced-by-count":1,"title":["Monte Carlo circuits for the abelian permutation group intersection problem"],"prefix":"10.1007","volume":"23","author":[{"given":"Costas S.","family":"Iliopoulos","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","unstructured":"Ajtai, M., Kolmos, J., Szemeredi, E.: A O(n logn) sorting network. pp. 1?9. 15th. ACM Symposium on Theory of Computing. Boston, Mass 1983","DOI":"10.1145\/800061.808726"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0020-0190(85)90086-9","volume":"20","author":"W.M. Beynon","year":"1985","unstructured":"Beynon, W.M., Iliopoulos, C.S.: Computing a basis for a finite abelian p-group. Inf. Process. Lett. 20, 161?163 (1985)","journal-title":"Inf. Process. Lett."},{"key":"CR3","unstructured":"Cook, S.A.: Towards a Complexity theory of synchronous parallel computation in L'enseignement mathematique. Serie II. Tome XXVII 1981"},{"key":"CR4","doi-asserted-by":"crossref","unstructured":"Furst, M., Hopcroft, J., Luks, E.: Polynomial time algorithms for permutation groups. pp. 36?41. Proc. 21st IEEE Symposium on Foundations of Computer Science. Syracuse, NY 1980","DOI":"10.1109\/SFCS.1980.34"},{"key":"CR5","volume-title":"Lect. Notes Comput. Sci. 136","author":"G.M. Hoffman","year":"1982","unstructured":"Hoffman, G.M.: Group-theoretic algorithms and graph isomorphism. Lect. Notes Comput. Sci. 136. Berlin, Heidelberg, New York: Springer 1982"},{"key":"CR6","unstructured":"Iliopoulos, C.S.: Worst-case complexity bounds on algorithms for computing the canonical structure of abelian groups and the Hermite and Smith normal forms of an integer matrix. (To appear in SIAM Comput.)"},{"key":"CR7","doi-asserted-by":"crossref","unstructured":"McKenjie, P., Cook, S.A.: The parallel complexity of the abelian permutation group membership problem. pp. 154?161. 24th IEEE Symposium on Foundations of Computer Science. Tucson, Arizona 1983","DOI":"10.1109\/SFCS.1983.74"},{"key":"CR8","doi-asserted-by":"crossref","unstructured":"Pippinger, N.: On simultaneous resource bounds. Proc. 20th Symposium on Foundations of Computer Science. San Juan, Puerto Rico 1979","DOI":"10.1109\/SFCS.1979.29"},{"key":"CR9","doi-asserted-by":"crossref","unstructured":"Reif, J.: Logarithmic depth circuits for algebraic functions. 24th IEEE Symposium on Foundations of Computer Science. Tucson, Arizona 1983","DOI":"10.1109\/SFCS.1983.29"},{"key":"CR10","unstructured":"Reif, J.: Parallel algorithms for graph isomorphism. TR-14-83, Aiken Computation Laboratory, Harvard Univ., 1983"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0196-6774(82)90008-6","volume":"3","author":"Y. Shiloach","year":"1982","unstructured":"Shiloach, Y., Viskin, U.: An O(n 2log n) parallel MAX-FLOW algorithm. J. Algorithms 3, 57?67 (1982)","journal-title":"J. Algorithms"},{"key":"CR12","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1090\/psapm\/020\/0357556","volume":"20","author":"C.C. Sims","year":"1974","unstructured":"Sims, C.C.: The influence of computers in algebra. Proc. Symp. Appl. Math. 20, 13?30 (1974)","journal-title":"Proc. Symp. Appl. Math."},{"key":"CR13","volume-title":"Finite permutation groups","author":"H. Wielandt","year":"1964","unstructured":"Wielandt, H.: Finite permutation groups. New York: Academic Press 1964"},{"key":"CR14","first-page":"589","volume":"7","author":"Y. Ofman","year":"1963","unstructured":"Ofman, Y.: On the algorithmic complexity of Discrete functions. Sov. Phys. Dokl. 7, 589?591 (1963)","journal-title":"Sov. Phys. Dokl."}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00264315.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00264315\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00264315","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,18]],"date-time":"2024-12-18T19:44:19Z","timestamp":1734551059000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00264315"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,11]]},"references-count":14,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1986,11]]}},"alternative-id":["BF00264315"],"URL":"https:\/\/doi.org\/10.1007\/bf00264315","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"type":"print","value":"0001-5903"},{"type":"electronic","value":"1432-0525"}],"subject":[],"published":{"date-parts":[[1986,11]]}}}