乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,6]],"date-time":"2024-10-06T00:27:34Z","timestamp":1728174454034},"reference-count":21,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1997,4,1]],"date-time":"1997-04-01T00:00:00Z","timestamp":859852800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2002,5,25]],"date-time":"2002-05-25T00:00:00Z","timestamp":1022284800000},"content-version":"vor","delay-in-days":1880,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information and Computation"],"published-print":{"date-parts":[[1997,4]]},"DOI":"10.1006\/inco.1997.2621","type":"journal-article","created":{"date-parts":[[2002,10,6]],"date-time":"2002-10-06T21:10:40Z","timestamp":1033938640000},"page":"59-74","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":25,"title":["A Quasi-polynomial-time Algorithm for Sampling Words from a Context-Free Language"],"prefix":"10.1006","volume":"134","author":[{"given":"Vivek","family":"Gore","sequence":"first","affiliation":[]},{"given":"Mark","family":"Jerrum","sequence":"additional","affiliation":[]},{"given":"Sampath","family":"Kannan","sequence":"additional","affiliation":[]},{"given":"Z.","family":"Sweedyk","sequence":"additional","affiliation":[]},{"given":"Steve","family":"Mahaney","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1006\/inco.1997.2621_IC972621RF1","doi-asserted-by":"crossref","first-page":"368","DOI":"10.1007\/BF01275489","article-title":"The complexity of computing maximal word functions","volume":"3","author":"Allender","year":"1993","journal-title":"Comput. Complexity"},{"key":"10.1006\/inco.1997.2621_IC972621RF2","doi-asserted-by":"crossref","unstructured":"Eric, Allender, Jia, Jiao, 1993, Depth reduction for noncommutative arithmetic circuits, Proceedings of the 25th ACM Symposium on Theory of Computing, Assoc. Comput. Mach. New York","DOI":"10.1145\/167088.167226"},{"key":"10.1006\/inco.1997.2621_IC972621RF3","doi-asserted-by":"crossref","first-page":"532","DOI":"10.1109\/T-C.1973.223757","article-title":"The parallel evaluation of arithmetic expressions without division","volume":"C-22","author":"Brent","year":"1973","journal-title":"IEEE Trans. Comput."},{"key":"10.1006\/inco.1997.2621_IC972621RF4","first-page":"143","article-title":"On formal properties of simple phrase structure grammars","volume":"14","author":"Bar-Hillel","year":"1961","journal-title":"Z. Phonet. Sprachwiss. Kommunikationsforsch."},{"key":"10.1006\/inco.1997.2621_IC972621RF5","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1006\/inco.1997.2621_IC972621RF6","author":"Gore","year":"1995","journal-title":"Report ECS-LFCS-95-326"},{"key":"10.1006\/inco.1997.2621_IC972621RF7","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1145\/321312.321318","article-title":"Preservation of unambiguity and inherent ambiguity in context-free languages","volume":"13","author":"Ginsburg","year":"1966","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1006\/inco.1997.2621_IC972621RF8","doi-asserted-by":"crossref","first-page":"645","DOI":"10.1137\/0212044","article-title":"Uniform random generation of strings in a context-free language","volume":"12","author":"Hickey","year":"1983","journal-title":"SIAM J. Comput."},{"key":"10.1006\/inco.1997.2621_IC972621RF9","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1080\/01621459.1963.10500830","article-title":"Probability inequalities for sums of bounded random variables","volume":"58","author":"Hoeffding","year":"1963","journal-title":"J. Amer. Statist. Assoc."},{"key":"10.1006\/inco.1997.2621_IC972621RF10","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/0304-3975(86)90174-X","article-title":"Random generation of combinatorial structures from a uniform distribution","volume":"43","author":"Jerrum","year":"1986","journal-title":"Theoret. Comput. Sci."},{"key":"10.1006\/inco.1997.2621_IC972621RF11","unstructured":"Sampath, Kannan, Z. Sweedyk, Steve, Mahaney, 1995, Counting and random generation of strings in regular languages, Proceedings of the 6th ACM\u2013SIAM Symposium on Discrete Algorithms"},{"key":"10.1006\/inco.1997.2621_IC972621RF12","unstructured":"Richard, M. Karp, Michael, Luby, 1983, Monte-Carlo algorithms for enumeration and reliability problems, Proceedings of the 24th IEEE Symposium on Foundations of Computer Science, Comput. Soc. Press"},{"key":"10.1006\/inco.1997.2621_IC972621RF13","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1016\/0196-6774(89)90038-2","article-title":"Monte-Carlo approximation algorithms for enumeration problems","volume":"10","author":"Karp","year":"1989","journal-title":"J. Algorithms"},{"key":"10.1006\/inco.1997.2621_IC972621RF14","doi-asserted-by":"crossref","unstructured":"M. Mahajan, V. Vinay, 1994, Non-commutative computation, depth reduction and skew circuits, Proceedings of the Foundations of Software Technology and Theoretical Computer Science Symposium, Springer-Verlag, Berlin\/New York","DOI":"10.1007\/3-540-58715-2_113"},{"key":"10.1006\/inco.1997.2621_IC972621RF15","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0020-0190(94)90033-7","article-title":"Generating words in a context-free language uniformly at random","volume":"49","author":"Mairson","year":"1994","journal-title":"Inform. Process. Lett."},{"key":"10.1006\/inco.1997.2621_IC972621RF16","series-title":"London Mathematical Society Lecture Note Series","article-title":"On the method of bounded differences","author":"McDiarmid","year":"1989"},{"key":"10.1006\/inco.1997.2621_IC972621RF17","doi-asserted-by":"crossref","unstructured":"Noam, Nisan, 1991, Lower bounds for non-commutative computation, Proceedings of the 23rd ACM Symposium on Theory of Computing, Assoc. Comput. Mach. New York","DOI":"10.1145\/103418.103462"},{"key":"10.1006\/inco.1997.2621_IC972621RF18","series-title":"Artificial Intelligence and Molecular Biology","article-title":"The computational linguistics of biological sequences","author":"Searls","year":"1993"},{"key":"10.1006\/inco.1997.2621_IC972621RF19","series-title":"Algorithms for Random Generation and Counting: A Markov Chain Approach","author":"Sinclair","year":"1993"},{"key":"10.1006\/inco.1997.2621_IC972621RF20","first-page":"459","article-title":"A finite state machine algorithm for finding restriction sites and other pattern matching applications","volume":"4","author":"Smith","year":"1988","journal-title":"Comput. Appl. Biosci."},{"key":"10.1006\/inco.1997.2621_IC972621RF21","doi-asserted-by":"crossref","first-page":"641","DOI":"10.1137\/0212043","article-title":"Fast parallel computation on polynomials using few processors","volume":"12","author":"Valliant","year":"1983","journal-title":"SIAM J. Comput."}],"container-title":["Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0890540197926213?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0890540197926213?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2022,10,24]],"date-time":"2022-10-24T09:34:58Z","timestamp":1666604098000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0890540197926213"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,4]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1997,4]]}},"alternative-id":["S0890540197926213"],"URL":"https:\/\/doi.org\/10.1006\/inco.1997.2621","relation":{},"ISSN":["0890-5401"],"issn-type":[{"value":"0890-5401","type":"print"}],"subject":[],"published":{"date-parts":[[1997,4]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A Quasi-polynomial-time Algorithm for Sampling Words from a Context-Free Language","name":"articletitle","label":"Article Title"},{"value":"Information and Computation","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1006\/inco.1997.2621","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1997 Academic Press. All rights reserved.","name":"copyright","label":"Copyright"}]}}