{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,26]],"date-time":"2025-02-26T05:34:04Z","timestamp":1740548044424,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540228943"},{"type":"electronic","value":"9783540278214"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27821-4_36","type":"book-chapter","created":{"date-parts":[[2010,9,14]],"date-time":"2010-09-14T18:54:06Z","timestamp":1284490446000},"page":"405-416","source":"Crossref","is-referenced-by-count":1,"title":["Testing the Independence Number of Hypergraphs"],"prefix":"10.1007","author":[{"given":"Michael","family":"Langberg","sequence":"first","affiliation":[]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Alon, N., Fernandez de la Vega, W., Kannan, R., Karpinski, M.: Random sampling and approximation of Max-CSP problems. In: Proceddings of STOC, pp. 232\u2013239 (2002)","key":"36_CR1","DOI":"10.1145\/509907.509945"},{"key":"36_CR2","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/S0196-6774(03)00019-1","volume":"47","author":"N. Alon","year":"2003","unstructured":"Alon, N., Shapira, A.: Testing satisfyability. Journal of Algorithms\u00a047, 87\u2013103 (2003)","journal-title":"Journal of Algorithms"},{"key":"36_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1007\/3-540-48224-5_41","volume-title":"Automata, Languages and Programming","author":"A. Czumaj","year":"2001","unstructured":"Czumaj, A., Sohler, C.: Testing hypergraph coloring. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol.\u00a02076, pp. 493\u2013505. Springer, Heidelberg (2001)"},{"key":"36_CR4","volume-title":"An introduction to probability theory and its applications","author":"W. Feller","year":"1966","unstructured":"Feller, W.: An introduction to probability theory and its applications, vol.\u00a02. John Wiley & Sons, Chichester (1966)"},{"key":"36_CR5","first-page":"97","volume":"75","author":"E. Fisher","year":"2001","unstructured":"Fisher, E.: The art of uninformed decisions: A primer to property testing. The Computational Complexity Column of The Bulletin of the European Association for Theoretical Computer Science\u00a075, 97\u2013126 (2001)","journal-title":"The Computational Complexity Column of The Bulletin of the European Association for Theoretical Computer Science"},{"doi-asserted-by":"crossref","unstructured":"Feige, U., Langberg, M., Schechtman, G.: Graphs with tiny vector chromatic numbers and huge chromatic numbers. In: proceedings of 43rd annual Symposium on Foundations of Computer Science, pp. 283\u2013292 (2002) To appear in SIAM Journal on Computing, availiable at http:\/\/www.cs.caltech.edu\/~mikel (manscript)","key":"36_CR6","DOI":"10.1109\/SFCS.2002.1181951"},{"issue":"4","key":"36_CR7","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1145\/285055.285060","volume":"45","author":"O. Goldreich","year":"1998","unstructured":"Goldreich, O., Goldwasser, S., Ron, D.: Property testing and its connection to learning and approximation. Journal of ACM\u00a045(4), 653\u2013750 (1998)","journal-title":"Journal of ACM"},{"doi-asserted-by":"crossref","unstructured":"Goldreich, O.: Combinatorial property testing - a survey. In: Pardalos, P., Rajasekaran, S., Rolim, J. (eds.) Randomization Methods in Algorithm Design AMS-DIMACS, pp. 45\u201360 (1998)","key":"36_CR8","DOI":"10.1090\/dimacs\/043\/04"},{"unstructured":"Langberg, M.: Testing the independence number of hypergraphs. Electronic Colloquium on Computational Complexity (ECCC), TR03-076 (2003)","key":"36_CR9"},{"key":"36_CR10","volume-title":"Handbook of Randomized Computing","author":"D. Ron","year":"2001","unstructured":"Ron, D.: Property testing (a tutorial). In: Rajasekaran, S., Pardalos, P.M., Reif, J.H., Rolim, J.D.P. (eds.) Handbook of Randomized Computing, Kluwer Press, Dordrecht (2001)"},{"key":"36_CR11","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1137\/S0097539793255151","volume":"25","author":"R. Rubinfeld","year":"1996","unstructured":"Rubinfeld, R., Sudan, M.: Robust characterization of polynomials with applications to program testing. SIAM Journal of Computing\u00a025, 252\u2013271 (1996)","journal-title":"SIAM Journal of Computing"}],"container-title":["Lecture Notes in Computer Science","Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27821-4_36.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T20:40:58Z","timestamp":1740516058000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27821-4_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540228943","9783540278214"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27821-4_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}