{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T12:11:59Z","timestamp":1648642319268},"reference-count":21,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1994,10,1]],"date-time":"1994-10-01T00:00:00Z","timestamp":780969600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6864,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1994,10]]},"DOI":"10.1016\/s0022-0000(05)80057-1","type":"journal-article","created":{"date-parts":[[2005,8,20]],"date-time":"2005-08-20T11:18:35Z","timestamp":1124536715000},"page":"408-424","source":"Crossref","is-referenced-by-count":2,"title":["Listing graphs that satisfy first-order sentences"],"prefix":"10.1016","volume":"49","author":[{"given":"Leslie Ann","family":"Goldberg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0022-0000(05)80057-1_bib1","series-title":"Structural Complexity I","author":"Balc\u00e1zar","year":"1988"},{"key":"10.1016\/S0022-0000(05)80057-1_bib2","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1016\/S0019-9958(85)80027-9","article-title":"A zero-one law for logic with a fixed-point operator","volume":"67","author":"Blass","year":"1985","journal-title":"Inform. and Control"},{"key":"10.1016\/S0022-0000(05)80057-1_bib3","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1002\/jgt.3190030305","article-title":"Properties of almost all graphs and complexes","volume":"3","author":"Blass","year":"1979","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0022-0000(05)80057-1_bib4","series-title":"Random Graphs","author":"Bollob\u00e1s","year":"1985"},{"key":"10.1016\/S0022-0000(05)80057-1_bib5","series-title":"Mathematical Logic","author":"Ebbinghaus","year":"1984"},{"issue":"No. 1","key":"10.1016\/S0022-0000(05)80057-1_bib6","doi-asserted-by":"crossref","first-page":"50","DOI":"10.2307\/2272945","article-title":"Probabilities on finite models","volume":"41","author":"Fagin","year":"1976","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/S0022-0000(05)80057-1_bib7","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1007\/BF01071084","article-title":"Range and degree of realizability of formulas in the restricted predicate calculus","volume":"5","author":"Glebskii","year":"1969","journal-title":"Cybernetics"},{"key":"10.1016\/S0022-0000(05)80057-1_bib8","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1016\/0196-6774(92)90009-2","article-title":"Efficient algorithms for listing unlabeled graphs","volume":"13","author":"Goldberg","year":"1992","journal-title":"J. Algorithms"},{"key":"10.1016\/S0022-0000(05)80057-1_bib9","series-title":"Efficient Algorithms for Listing Combinatorial Structures","author":"Goldberg","year":"1993"},{"key":"10.1016\/S0022-0000(05)80057-1_bib10","first-page":"90","article-title":"Zero-one laws: The logic in computer science column","volume":"46","author":"Gurevich","year":"1992","journal-title":"Bull. European Assoc. Theoret. Comput. Sci."},{"key":"10.1016\/S0022-0000(05)80057-1_bib11","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/0304-3975(84)90111-7","article-title":"Computation times of NP sets of different densities","volume":"34","author":"Hartmans","year":"1984","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0022-0000(05)80057-1_bib12","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/0304-3975(91)90388-I","article-title":"On sets polynomially enumerable by iteration","volume":"80","author":"Hemachandra","year":"1991","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0022-0000(05)80057-1_bib13","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/0020-0190(88)90065-8","article-title":"On generating all maximal independent sets","volume":"27","author":"Johnson","year":"1988","journal-title":"Inform. Process. Lett."},{"issue":"No. 1","key":"10.1016\/S0022-0000(05)80057-1_bib14","doi-asserted-by":"crossref","first-page":"130","DOI":"10.2307\/2272354","article-title":"Turing machines and the spectra of first-order formulas","volume":"39","author":"Jones","year":"1974","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/S0022-0000(05)80057-1_bib15","series-title":"Combinatorial Algorithms for Computers and Calculators","author":"Nijenhuis","year":"1978"},{"key":"10.1016\/S0022-0000(05)80057-1_bib16","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1016\/0022-0000(88)90003-7","article-title":"Probabilistic construction of deterministic algorithms: Approximate packing integer programs","volume":"37","author":"Raghavan","year":"1988","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0022-0000(05)80057-1_bib17","series-title":"Combinatorial Mathematics, VIII","first-page":"77","article-title":"A survey of graph generation techniques","volume":"Vol. 884","author":"Read","year":"1981"},{"key":"10.1016\/S0022-0000(05)80057-1_bib18","series-title":"Ten Lectures on the Probabilistic Method","author":"Spencer","year":"1987"},{"key":"10.1016\/S0022-0000(05)80057-1_bib19","series-title":"Undergraduate Texts in Matheamtics","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-4968-9","article-title":"Constructive Combinatorics","author":"Stanton","year":"1986"},{"key":"10.1016\/S0022-0000(05)80057-1_bib20","unstructured":"M. Y. Vardi, personal communication (see \u201cOn the Bounded Satisfability Problem,\u201d by P. G. Kolaitis and M. Y. Vardi, to appear.)"},{"issue":"No. 2","key":"10.1016\/S0022-0000(05)80057-1_bib21","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1145\/321510.321525","article-title":"Toward a theory of enumerations","volume":"16","author":"Young","year":"1969","journal-title":"J. Assoc. Comput. Mach."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000005800571?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000005800571?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,22]],"date-time":"2019-01-22T22:27:10Z","timestamp":1548196030000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000005800571"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,10]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1994,10]]}},"alternative-id":["S0022000005800571"],"URL":"https:\/\/doi.org\/10.1016\/s0022-0000(05)80057-1","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1994,10]]}}}