{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:19:18Z","timestamp":1725567558624},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642163661"},{"type":"electronic","value":"9783642163678"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-16367-8_30","type":"book-chapter","created":{"date-parts":[[2010,10,7]],"date-time":"2010-10-07T11:25:55Z","timestamp":1286450755000},"page":"355-358","source":"Crossref","is-referenced-by-count":0,"title":["Green\u2019s Conjecture and Testing Linear Invariant Properties"],"prefix":"10.1007","author":[{"given":"Asaf","family":"Shapira","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"30_CR1","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1016\/j.jcss.2004.04.008","volume":"69","author":"N. Alon","year":"2004","unstructured":"Alon, N., Shapira, A.: Testing Subgraphs in Directed Graphs. Journal of Computer and System Sciences\u00a069, 354\u2013382 (2004)","journal-title":"Journal of Computer and System Sciences"},{"key":"30_CR2","unstructured":"Austin, T., Tao, T.: On the testability and repair of hereditary hypergraph properties (2008) (manuscript)"},{"key":"30_CR3","first-page":"549","volume":"47","author":"M. Blum","year":"1993","unstructured":"Blum, M., Luby, M., Rubinfeld, R.: Self-testing\/correcting with applications to numerical problems. JCSS\u00a047, 549\u2013595 (1993)","journal-title":"JCSS"},{"key":"30_CR4","unstructured":"Bhattacharyya, A., Chen, V., Sudan, M., Xie, N.: Testing linear-invariant non-linear properties (2008) (manuscript)"},{"key":"30_CR5","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1002\/rsa.10017","volume":"20","author":"P. Frankl","year":"2002","unstructured":"Frankl, P., R\u00f6dl, V.: Extremal problems on set systems. Random Structures and Algorithms\u00a020, 131\u2013164 (2002)","journal-title":"Random Structures and Algorithms"},{"key":"30_CR6","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/BF02790016","volume":"34","author":"H. Furstenberg","year":"1978","unstructured":"Furstenberg, H., Katznelson, Y.: An ergodic Szemer\u00e9di theorem for commuting transformations. J. Analyse Math.\u00a034, 275\u2013291 (1978)","journal-title":"J. Analyse Math."},{"issue":"4","key":"30_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. JACM\u00a045(4), 653\u2013750 (1998)","journal-title":"JACM"},{"issue":"3","key":"30_CR8","doi-asserted-by":"publisher","first-page":"897","DOI":"10.4007\/annals.2007.166.897","volume":"166","author":"T. Gowers","year":"2007","unstructured":"Gowers, T.: Hypergraph regularity and the multidimensional Szemer\u00e9di theorem. Ann. of Math.\u00a0166(3), 897\u2013946 (2007)","journal-title":"Ann. of Math."},{"key":"30_CR9","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1017\/S0963548305007236","volume":"15","author":"T. Gowers","year":"2006","unstructured":"Gowers, T.: Quasirandomness, counting and regularity for 3-uniform hypergraphs. Combinatorics, Probability and Computing\u00a015, 143\u2013184 (2006)","journal-title":"Combinatorics, Probability and Computing"},{"key":"30_CR10","first-page":"340","volume":"15","author":"B. Green","year":"2005","unstructured":"Green, B.: A Szemer\u00e9di-type regularity lemma in abelian groups. GAFA\u00a015, 340\u2013376 (2005)","journal-title":"GAFA"},{"key":"30_CR11","unstructured":"Ishigami, Y.: A simple regularization of hypergraphs, http:\/\/arxiv.org\/abs\/math\/0612838"},{"key":"30_CR12","unstructured":"Kr\u00e1l\u2019, D., Serra, O., Vena, L.: A combinatorial proof of the removal lemma for groups, arXiv:0804.4847v1"},{"key":"30_CR13","unstructured":"Kr\u00e1l\u2019, D., Serra, O., Vena, L.: A removal lemma for linear systems over finite fields. Jornadas de Matematica Discreta y algortimica (2008)"},{"key":"30_CR14","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1002\/rsa.20117","volume":"28","author":"B. Nagle","year":"2006","unstructured":"Nagle, B., R\u00f6dl, V., Schacht, M.: The counting lemma for regular k-uniform hypergraphs. Random Structures and Algorithms\u00a028, 113\u2013179 (2006)","journal-title":"Random Structures and Algorithms"},{"key":"30_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/rsa.20017","volume":"25","author":"V. R\u00f6dl","year":"2004","unstructured":"R\u00f6dl, V., Skokan, J.: Regularity lemma for k-uniform hypergraphs. Random Structures and Algorithms\u00a025, 1\u201342 (2004)","journal-title":"Random Structures and Algorithms"},{"key":"30_CR16","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1112\/jlms\/s1-28.1.104","volume":"28","author":"K.F. Roth","year":"1953","unstructured":"Roth, K.F.: On certain sets of integers. J. London Math. Soc.\u00a028, 104\u2013109 (1953)","journal-title":"J. London Math. Soc."},{"key":"30_CR17","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 J. on Computing\u00a025, 252\u2013271 (1996)","journal-title":"SIAM J. on Computing"},{"key":"30_CR18","unstructured":"Ruzsa, I., Szemer\u00e9di, E.: Triple systems with no six points carrying three triangles. In: Combinatorics, Keszthely, vol. II. Coll. Math. Soc. J. Bolyai\u00a018, pp. 939\u2013945 (1976)"},{"key":"30_CR19","doi-asserted-by":"crossref","unstructured":"Shapira, A.: Green\u2019s conjecture and testing linear invariant properties. In: Proc. of STOC 2009, pp. 159\u2013166 (2009)","DOI":"10.1145\/1536414.1536438"},{"key":"30_CR20","doi-asserted-by":"crossref","first-page":"299","DOI":"10.4064\/aa-27-1-199-245","volume":"27","author":"E. Szemer\u00e9di","year":"1975","unstructured":"Szemer\u00e9di, E.: Integer sets containing no k elements in arithmetic progression. Acta Arith.\u00a027, 299\u2013345 (1975)","journal-title":"Acta Arith."},{"key":"30_CR21","unstructured":"Szemer\u00e9di, E.: Regular partitions of graphs. In: Bermond, J.C., Fournier, J.C., Las Vergnas, M., Sotteau, D. (eds.) Proc. Colloque Inter. CNRS, pp. 399\u2013401 (1978)"},{"key":"30_CR22","doi-asserted-by":"publisher","first-page":"1257","DOI":"10.1016\/j.jcta.2005.11.006","volume":"113","author":"T. Tao","year":"2006","unstructured":"Tao, T.: A variant of the hypergraph removal lemma. J. Combin. Theory, Ser. A\u00a0113, 1257\u20131280 (2006)","journal-title":"J. Combin. Theory, Ser. A"}],"container-title":["Lecture Notes in Computer Science","Property Testing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16367-8_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,5]],"date-time":"2019-06-05T05:10:50Z","timestamp":1559711450000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16367-8_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642163661","9783642163678"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16367-8_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}