{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:32:50Z","timestamp":1725485570472},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540651420"},{"type":"electronic","value":"9783540495437"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/3-540-49543-6_4","type":"book-chapter","created":{"date-parts":[[2007,6,7]],"date-time":"2007-06-07T02:58:05Z","timestamp":1181185085000},"page":"35-46","source":"Crossref","is-referenced-by-count":7,"title":["Deterministic Hypergraph Coloring and Its Applications"],"prefix":"10.1007","author":[{"given":"Chi-Jen","family":"Lu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[1999,6,11]]},"reference":[{"issue":"4","key":"4_CR1","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1002\/rsa.3240020403","volume":"2","author":"N. Alon","year":"1991","unstructured":"N. Alon, A parallel algorithmic version of the local lemma, Random Structures and Algorithms, 2(4), pages 367\u2013378, 1991","journal-title":"Random Structures and Algorithms"},{"issue":"4","key":"4_CR2","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1002\/rsa.3240020402","volume":"2","author":"J. Beck","year":"1991","unstructured":"J. Beck, An algorithmic approach to the Lov\u00e1sz local lemma, Random Structures and Algorithms, 2(4), pages 343\u2013365, 1991","journal-title":"Random Structures and Algorithms"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"G. Even, O. Goldreich, M. Luby, N. Nisan, and B. Velickovi\u0107, Approximations of general independent distributions. In Proceedings of the 24th Annual ACM Symposium on Theory of Computing, pages 10\u201316, 1992.","DOI":"10.1145\/129712.129714"},{"key":"4_CR4","unstructured":"P. Erd\u00f6s and L. Lov\u00e1sz, problems and results on 3-chromatic hypergraphs and some related questions, in A. Hajnal et. al. Eds, Infinite and Finite Sets, North Holland, 1975, pages 609\u2013628."},{"key":"4_CR5","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/BF00403406","volume":"3","author":"Z. F\u00fcredi","year":"1986","unstructured":"Z. F\u00fcredi and J. Kahn, On the dimensions of ordered sets of bounded degree, Order, 3, pages 15\u201320, 1986.","journal-title":"Order"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"M. Luby and B. Velickovi\u0107, On deterministic approximate counting of DNF, In Proceedings of the 23nd Annual ACM Symposium on Theory of Computing, pages 430\u2013438, 1991.","DOI":"10.1145\/103418.103464"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"M. Luby, B. Velickovi\u0107, and A. Wigderson, Deterministic approximate counting of depth-2 circuits, In Proceedings of the Second Israeli Symposium on Theory of Computing and Systems, 1993.","DOI":"10.1109\/ISTCS.1993.253488"},{"issue":"1","key":"4_CR8","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/BF01375474","volume":"11","author":"N. Nisan","year":"1991","unstructured":"N. Nisan, Pseudo-random bits for constant depth circuits, Combinatorica, 11(1), pages 63\u201370, 1991","journal-title":"Combinatorica"},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"N. Nisan and A. Wigderson, Hardness vs. randomness, In Proceedings of the 29th Annual IEEE Symposium on Foundations of Computer Science, pages 2\u201311, 1988.","DOI":"10.1109\/SFCS.1988.21916"},{"key":"4_CR10","first-page":"683","volume":"38","author":"P. Raghavan","year":"1994","unstructured":"P. Raghavan, Probabilistic construction of deterministic algorithm: Approximating packing integer programs, Journal of Computer and System Sciences, 38, pages 683\u2013707, 1994.","journal-title":"Journal of Computer and System Sciences"},{"key":"4_CR11","unstructured":"A. Srinivasan, An extension of the Lov\u00e1sz Local Lemma, and its applications to integer programming, In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, pages 6\u201315, 1996."},{"key":"4_CR12","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1137\/0208032","volume":"8","author":"L. G. Valiant","year":"1979","unstructured":"L. G. Valiant, The complexity of enumeration and reliability problems, SIAM Journal on Computing, 8, pages 410\u2013421, 1979.","journal-title":"SIAM Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","Randomization and Approximation Techniques in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-49543-6_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T19:45:53Z","timestamp":1556480753000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-49543-6_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540651420","9783540495437"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-49543-6_4","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1998]]}}}