{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,6]],"date-time":"2022-04-06T01:34:55Z","timestamp":1649208895855},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1993,7,1]],"date-time":"1993-07-01T00:00:00Z","timestamp":741484800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Systems Theory"],"published-print":{"date-parts":[[1993,7]]},"DOI":"10.1007\/bf01189853","type":"journal-article","created":{"date-parts":[[2005,2,17]],"date-time":"2005-02-17T21:46:49Z","timestamp":1108676809000},"page":"327-341","source":"Crossref","is-referenced-by-count":0,"title":["On the effective generation of set elements within specified ranges"],"prefix":"10.1007","volume":"26","author":[{"given":"Laura A.","family":"Sanchis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","unstructured":"M. Abadi, E. Allender, A. Broder, J. Feigenbaum, and L. Hemachandra. On generating solved instances of computational problems. InProceedings of CRYPTO 88, August 1988."},{"key":"CR2","doi-asserted-by":"crossref","unstructured":"E. Bach. How to generate random integers with known factorization. InProceedings of the 15th Annual ACM Symposium on Theory of Computing, pages 184?188, 1983.","DOI":"10.1145\/800061.808747"},{"key":"CR3","doi-asserted-by":"crossref","unstructured":"M. Blum and R. Impagliazzo. Generic oracles and oracle classes. InProceedings of the 28th Annual Symposium on Foundations of Computer Science, pages 118?126, October 1987.","DOI":"10.1109\/SFCS.1987.30"},{"key":"CR4","unstructured":"J. Feigenbaum, R. J. Lipton, and S. R. Mahaney. A completeness theorem for almost-everywhere invulnerable generators. AT&T Bell Laboratories Technical Memorandum, February 1989."},{"key":"CR5","unstructured":"L. Hemachandra, E. Allender, J. Feigenbaum, M. Abadi, and A. Broder. Generating hard, certified elements of NP-complete sets. AT&T Bell Laboratories Technical Memorandum, February 1989."},{"issue":"3","key":"CR6","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1142\/S0129054191000121","volume":"2","author":"D. T. Huynh","year":"1991","unstructured":"D. T. Huynh. Efficient detectors and constructors for simple languages.International Journal of Foundations of Computer Science, 2(3): 183?205, September 1991.","journal-title":"International Journal of Foundations of Computer Science"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/0304-3975(86)90174-X","volume":"43","author":"M. R. Jerrum","year":"1986","unstructured":"M. R. Jerrum, L. G. Valiant, and V. V. Vazirani. Random generation of combinatorial structures from a uniform distribution.Theoretical Computer Science, 43:169?188, 1986.","journal-title":"Theoretical Computer Science"},{"issue":"9","key":"CR8","doi-asserted-by":"crossref","first-page":"1112","DOI":"10.1109\/TC.1987.5009543","volume":"36","author":"B. Krishnamurthy","year":"1987","unstructured":"B. Krishnamurthy. Constructing test cases for partitioning heuristics.IEEE Transactions on Computers, 36(9): 1112?1114, September 1987.","journal-title":"IEEE Transactions on Computers"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1016\/0196-6774(90)90029-E","volume":"11","author":"B. D. McKay","year":"1990","unstructured":"B. D. McKay and N. C. Wormald. Uniform generation of random regular graphs of moderate degree.Journal of Algorithms, 11:52?67, 1990.","journal-title":"Journal of Algorithms"},{"key":"CR10","volume-title":"Combinatorial Algorithms","author":"A. Nijenhuis","year":"1978","unstructured":"A. Nijenhuis and H. S. Wilf.Combinatorial Algorithms. Academic Press, New York, 1978."},{"key":"CR11","unstructured":"M. G. Pilcher and R. L. Rardin. A random cut generator for symmetric traveling salesman problems with known optimal solutions. Technical Report CC-87-4, Institute for Interdisciplinary Engineering Studies, Purdue University, February 1987."},{"key":"CR12","unstructured":"L. A. Sanchis. Test case construction for NP-hard problems. InProceedings of the 26th Annual Allerton Conference on Communication, Control, and Computing, pages 711?720, September 1988."},{"issue":"2","key":"CR13","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1137\/0219019","volume":"19","author":"L. A. Sanchis","year":"1990","unstructured":"L. A. Sanchis and M. A. Fulk. On the efficient generation of language instances.SI AM Journal on Computing, 19(2):281?296, April 1990.","journal-title":"SI AM Journal on Computing"},{"key":"CR14","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-02460-7","volume-title":"Recursively Enumerable Sets and Degrees","author":"R. I. Soare","year":"1987","unstructured":"R. I. Soare.Recursively Enumerable Sets and Degrees. Springer-Verlag, New York, 1987."},{"key":"CR15","first-page":"265","volume":"13","author":"G. Tinhofer","year":"1979","unstructured":"G. Tinhofer. On the generation of random graphs with given properties and known distribution.Applied Computer Science, 13:265?297, 1979.","journal-title":"Applied Computer Science"}],"container-title":["Mathematical Systems Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01189853.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01189853\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01189853","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T13:08:04Z","timestamp":1556629684000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01189853"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,7]]},"references-count":15,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1993,7]]}},"alternative-id":["BF01189853"],"URL":"https:\/\/doi.org\/10.1007\/bf01189853","relation":{},"ISSN":["0025-5661","1433-0490"],"issn-type":[{"value":"0025-5661","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,7]]}}}