{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T17:10:02Z","timestamp":1743095402673,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642382352"},{"type":"electronic","value":"9783642382369"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38236-9_19","type":"book-chapter","created":{"date-parts":[[2013,4,15]],"date-time":"2013-04-15T02:38:02Z","timestamp":1365993482000},"page":"205-211","source":"Crossref","is-referenced-by-count":0,"title":["On Efficient Constructions of Short Lists Containing Mostly Ramsey Graphs"],"prefix":"10.1007","author":[{"given":"Marius","family":"Zimand","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"19_CR1","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1002\/rsa.3240030308","volume":"3","author":"N. Alon","year":"1992","unstructured":"Alon, N., Goldreich, O., H\u00e5stad, J., Peralta, R.: Simple constructions of almost k-wise independent random variables. Random Structures and Algorithms\u00a03(3), 289\u2013304 (1992)","journal-title":"Random Structures and Algorithms"},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"Barak, B., Rao, A., Shaltiel, R., Wigderson, A.: 2-source dispersers for sub-polynomial entropy and Ramsey graphs beating the Frankl-Wilson construction. In: Kleinberg, J.M. (ed.) STOC, pp. 671\u2013680. ACM (2006)","DOI":"10.1145\/1132516.1132611"},{"key":"19_CR3","unstructured":"Fortnow, L.: Full derandomization. Computational Complexity blog (July 31, 2006)"},{"issue":"4","key":"19_CR4","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/BF02579457","volume":"1","author":"P. Frankl","year":"1981","unstructured":"Frankl, P., Wilson, R.M.: Intersection theorems with geometric consequences. Combinatorica\u00a01(4), 357\u2013368 (1981)","journal-title":"Combinatorica"},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"Gasarch, W.I., Haeupler, B.: Lower bounds on van der Waerden numbers: Randomized- and deterministic-constructive. Electr. J. Comb.\u00a018(1) (2011)","DOI":"10.37236\/551"},{"key":"19_CR6","first-page":"220","volume-title":"Proceedings of the 29th Annual ACM Symposium on the Theory of Computing (STOC 1997)","author":"R. Impagliazzo","year":"1997","unstructured":"Impagliazzo, R., Wigderson, A.: P = BPP if E requires exponential circuits: Derandomizing the XOR lemma. In: Proceedings of the 29th Annual ACM Symposium on the Theory of Computing (STOC 1997), pp. 220\u2013229. Association for Computing Machinery, New York (1997)"},{"issue":"5","key":"19_CR7","doi-asserted-by":"publisher","first-page":"1501","DOI":"10.1137\/S0097539700389652","volume":"31","author":"A. Klivans","year":"2002","unstructured":"Klivans, A., van Melkebeek, D.: Graph nonisomorphism has subexponential size proofs unless the polynomial-time hierarchy collapses. SIAM J. Comput.\u00a031(5), 1501\u20131526 (2002)","journal-title":"SIAM J. Comput."},{"key":"19_CR8","doi-asserted-by":"crossref","unstructured":"Miltersen, P.B.: Derandomizing complexity classes. In: Pardalos, P., Reif, J., Rolim, J. (eds.) Handbook on Randomized Computing, Volume II. Kluwer Academic Publishers (2001)","DOI":"10.1007\/978-1-4615-0013-1_19"},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"Moser, R.A.: A constructive proof of the Lov\u00e1sz local lemma. In: Mitzenmacher, M. (ed.) STOC, pp. 343\u2013350. ACM (2009)","DOI":"10.1145\/1536414.1536462"},{"key":"19_CR10","unstructured":"Moore, C., Russell, A.: Optimal epsilon-biased sets with just a little randomness. CoRR, abs\/1205.6218 (2012)"},{"key":"19_CR11","doi-asserted-by":"crossref","unstructured":"Moser, R.A., Tardos, G.: A constructive proof of the general Lov\u00e1sz local lemma. J. ACM\u00a057(2) (2010)","DOI":"10.1145\/1667053.1667060"},{"key":"19_CR12","unstructured":"Naor, M.: Constructing Ramsey graphs from small probability spaces. Technical report, IBM Research Report RJ 8810 (70940) (1992)"},{"issue":"4","key":"19_CR13","doi-asserted-by":"publisher","first-page":"838","DOI":"10.1137\/0222053","volume":"22","author":"J. Naor","year":"1993","unstructured":"Naor, J., Naor, M.: Small-bias probability spaces: Efficient constructions and applications. SIAM Journal on Computing\u00a022(4), 838\u2013856 (1993)","journal-title":"SIAM Journal on Computing"},{"key":"19_CR14","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/S0022-0000(05)80043-1","volume":"49","author":"N. Nisan","year":"1994","unstructured":"Nisan, N., Wigderson, A.: Hardness vs. randomness. Journal of Computer and System Sciences\u00a049, 149\u2013167 (1994)","journal-title":"Journal of Computer and System Sciences"},{"issue":"3","key":"19_CR15","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/s00224-011-9368-x","volume":"51","author":"R. Santhanam","year":"2012","unstructured":"Santhanam, R.: The complexity of explicit constructions. Theory Comput. Syst.\u00a051(3), 297\u2013312 (2012)","journal-title":"Theory Comput. Syst."}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38236-9_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,13]],"date-time":"2023-02-13T16:09:37Z","timestamp":1676304577000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-38236-9_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642382352","9783642382369"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38236-9_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}