{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T21:56:33Z","timestamp":1775512593614,"version":"3.50.1"},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1991,3,1]],"date-time":"1991-03-01T00:00:00Z","timestamp":667785600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[1991,3]]},"DOI":"10.1007\/bf01375470","type":"journal-article","created":{"date-parts":[[2005,4,1]],"date-time":"2005-04-01T20:19:45Z","timestamp":1112386785000},"page":"23-32","source":"Crossref","is-referenced-by-count":5,"title":["An ?(n 5\/4) lower bound on the randomized complexity of graph properties"],"prefix":"10.1007","volume":"11","author":[{"given":"Valerie","family":"King","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"CR1","unstructured":"P. Hajnal: An ?(n 3\/4) lower bound on the randomized complexity of graph properties,The University of Chicago Tech. Report 88-004, April 1988."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/BF02579140","volume":"4","author":"J. Kahn","year":"1984","unstructured":"J. Kahn, M. Saks, andD. Sturtevant A topological approach to evasiveness,Combinatorica 4 (1984), pp. 297?306.","journal-title":"Combinatorica"},{"key":"CR3","volume-title":"Lower bounds on the complexity of graph properties","author":"V. King","year":"1988","unstructured":"V. King:Lower bounds on the complexity of graph properties, Ph. D. Thesis, University of California, Berkeley, (May, 1988)."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0095-8956(80)90057-X","volume":"28","author":"D. J. Kleitman","year":"1980","unstructured":"D. J. Kleitman, andK. J. Kwiatkowski: Further results on the Aanderaa-Rosenberg conjecture.J. Combinatorial Theory 28 (1980), pp. 85?95.","journal-title":"J. Combinatorial Theory"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1016\/0304-3975(76)90053-0","volume":"3","author":"R. Rivest","year":"1978","unstructured":"R. Rivest, andS. Vuillemin: On recognizing graph properties from adjacency matrices,Theor. Comp. Sci. 3 (1978) pp. 371?384.","journal-title":"Theor. Comp. Sci."},{"issue":"4","key":"CR6","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1145\/1008299.1008302","volume":"5","author":"A. L. Rosenberg","year":"1973","unstructured":"A. L. Rosenberg: On the time required to recognize properties of graph: a problem.SIGACT News 5 (4) (1973), pp. 15?16.","journal-title":"SIGACT News"},{"issue":"3","key":"CR7","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/0095-8956(78)90005-9","volume":"25","author":"N. Sauer","year":"1978","unstructured":"N. Sauer, andJ. Spencer: Edge-disjoint placement of graphs,Combinatorial Theory, Ser. B,25, 3, (1978), pp. 295?302.","journal-title":"Combinatorial Theory"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"19","DOI":"10.4064\/cm-3-1-19-30","volume":"3","author":"P. Tur\ufffdn","year":"1954","unstructured":"P. Tur\ufffdn: On the theory of graphs,Colloq. Math. 3, (1954), pp. 19?30.","journal-title":"Colloq. Math."},{"key":"CR9","doi-asserted-by":"crossref","unstructured":"A. Yao: Probabilistic computations: towards a unified measure of complexity,Proc. 18th Annual Symposium on the Foundations of Computer Science, (1977), pp. 222?227.","DOI":"10.1109\/SFCS.1977.24"},{"key":"CR10","doi-asserted-by":"crossref","unstructured":"A. Yao: Lower bounds to randomized algorithms for graph properties,Proc 28th Annual Symposium on the Foundations of Computer Science, (1987), pp. 393?400. To appear inJour of Comp. Sys. Sci.","DOI":"10.1109\/SFCS.1987.39"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01375470.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01375470\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01375470","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T15:21:53Z","timestamp":1556810513000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01375470"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,3]]},"references-count":10,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1991,3]]}},"alternative-id":["BF01375470"],"URL":"https:\/\/doi.org\/10.1007\/bf01375470","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991,3]]}}}