{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,23]],"date-time":"2025-06-23T16:04:53Z","timestamp":1750694693041},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2007,5,1]],"date-time":"2007-05-01T00:00:00Z","timestamp":1177977600000},"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":[[2007,5]]},"DOI":"10.1007\/s00493-007-2154-3","type":"journal-article","created":{"date-parts":[[2008,5,28]],"date-time":"2008-05-28T01:17:24Z","timestamp":1211937444000},"page":"293-327","source":"Crossref","is-referenced-by-count":6,"title":["Testing of matrix-poset properties"],"prefix":"10.1007","volume":"27","author":[{"given":"Eldar","family":"Fischer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ilan","family":"Newman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,5,29]]},"reference":[{"issue":"4","key":"2154_CR1","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1007\/s004930070001","volume":"20","author":"N. Alon","year":"2000","unstructured":"N. Alon, E. Fischer, M. Krivelevich and M. Szegedy: Efficient testing of large graphs, Combinatorica 20(4) (2000), 451\u2013476.","journal-title":"Combinatorica"},{"key":"2154_CR2","unstructured":"N. Alon, E. Fischer and I. Newman: Testing of bipartite graph properties, SIAM J. of Computing, to appear."},{"issue":"6","key":"2154_CR3","doi-asserted-by":"crossref","first-page":"1842","DOI":"10.1137\/S0097539700366528","volume":"30","author":"N. Alon","year":"2000","unstructured":"N. Alon, M. Krivelevich, I. Newman and M. Szegedy: Regular languages are testable with a constant number of queries, SIAM J. of Computing 30(6) (2000), 1842\u20131862.","journal-title":"SIAM J. of Computing"},{"issue":"3","key":"2154_CR4","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1145\/278298.278306","volume":"45","author":"S. Arora","year":"1998","unstructured":"S. Arora, C. Lund, R. Motwani, M. Sudan and M. Szegedy: Proof verification and the hardness of approximation problems, JACM 45(3) (1998), 501\u2013555.","journal-title":"JACM"},{"key":"2154_CR5","doi-asserted-by":"crossref","unstructured":"T. Batu, R. Rubinfeld, P. White: Fast approximate PCPs for multidimensional bin-packing problems, in: RANDOM-APPROX99 Conference Proceedings, pages 245\u2013256, 1999.","DOI":"10.1007\/978-3-540-48413-4_25"},{"issue":"3","key":"2154_CR6","first-page":"549","volume":"47","author":"M. Blum","year":"1993","unstructured":"M. Blum, M. Luby and R. Rubinfeld: Self-testing\/correcting with applications to numerical problems, JCSS 47(3) (1993), 549\u2013595.","journal-title":"JCSS"},{"key":"2154_CR7","unstructured":"R. Diestel: Graph Theory (2nd edition), Springer, 2000."},{"key":"2154_CR8","first-page":"97","volume-title":"3rd RANDOM Conference Proceedings","author":"Y. Dodis","year":"1999","unstructured":"Y. Dodis, O. Goldreich, E. Lehman, S. Raskhodnikova, D. Ron and A. Samorodnitsky: Improved testing algorithms for monotonicity, in: 3rd RANDOM Conference Proceedings, pages 97\u2013108, Springer-Verlag, Berkeley CA, 1999."},{"issue":"3","key":"2154_CR9","first-page":"717","volume":"60","author":"F. Erg\u00fcn","year":"2000","unstructured":"F. Erg\u00fcn, S. Kannan, S. R. Kumar, R. Rubinfeld and M. Vviswanathan: Spot checkers, JCSS 60(3) (2000), 717\u2013751.","journal-title":"JCSS"},{"key":"2154_CR10","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/j.ic.2003.09.003","volume":"189","author":"E. Fischer","year":"2004","unstructured":"E. Fischer: On the strength of comparisons in property testing, Information and Computation 189 (2004), 107\u2013116.","journal-title":"Information and Computation"},{"key":"2154_CR11","doi-asserted-by":"crossref","unstructured":"E. Fischer: Testing graphs for colorability properties, in: 12th SODA Conference Proceedings, pages 873\u2013882, 2001. Also: Random Structures and Algorithms 26(3) (2005), 289\u2013309.","DOI":"10.1002\/rsa.20037"},{"key":"2154_CR12","first-page":"97","volume":"75","author":"E. Fischer","year":"2001","unstructured":"E. Fischer: The art of uninformed decisions: A primer to property testing; Computational Complexity Column, The Bulletin of the European Association for Theoretical Computer Science 75 (2001), 97\u2013126.","journal-title":"The Bulletin of the European Association for Theoretical Computer Science"},{"key":"2154_CR13","doi-asserted-by":"crossref","unstructured":"E. Fischer, E. Lehman, I. Newman, S. Raskhodnikova, R. Rubinfeld and A. Samorodnitsky: Monotonicity testing over general poest domains, in: 34th ACM STOC Conference Proceedings, pages 474\u2013483, 2002.","DOI":"10.1145\/509973.509977"},{"key":"2154_CR14","doi-asserted-by":"crossref","unstructured":"E. Fischer and I. Newman: Testing of matrix properties, in: 33 rd ACM STOC Conference Proceedings, pages 286\u2013295, 2001.","DOI":"10.1145\/380752.380812"},{"issue":"2","key":"2154_CR15","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1002\/rsa.10110","volume":"24","author":"E. Fischer","year":"2004","unstructured":"E. Fischer, I. Newman and J. Sgall: Functions that have read-twice constant width branching programs are not necessarily testable, Random Structures and Algorithms 24(2) (2004), 175\u2013193.","journal-title":"Random Structures and Algorithms"},{"key":"2154_CR16","doi-asserted-by":"crossref","unstructured":"P. Gemmell, R. Lipton, R. Rubinfeld, M. Sudan and A. Wigderson: Self-testing\/correcting for polynomials and for approximate functions, in: 23rd ACM STOC Conference Proceedings, pages 32\u201342, 1991.","DOI":"10.1145\/103418.103429"},{"issue":"3","key":"2154_CR17","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/s004930070011","volume":"20","author":"O. Goldreich","year":"2000","unstructured":"O. Goldreich, S. Goldwasser, E. Lehman, D. Ron and A. Samorodnitsky: Testing monotonicity, Combinatorica 20(3) (2000), 301\u2013337.","journal-title":"Combinatorica"},{"issue":"4","key":"2154_CR18","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1145\/285055.285060","volume":"45","author":"O. Goldreich","year":"1998","unstructured":"O. Goldreich, S. Goldwasser and D. Ron: Property testing and its connections to learning and approximation, JACM 45(4) (1998), 653\u2013750.","journal-title":"JACM"},{"issue":"2","key":"2154_CR19","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1007\/s00453-001-0078-7","volume":"32","author":"O. Goldreich","year":"2002","unstructured":"O. Goldreich and D. Ron: Property testing in bounded degree graphs. Algorithmica 32(2) (2002), 302\u2013343.","journal-title":"Algorithmica"},{"key":"2154_CR20","doi-asserted-by":"crossref","first-page":"50","DOI":"10.4064\/cm-3-1-50-57","volume":"3","author":"T. K\u0151v\u00e1ri","year":"1954","unstructured":"T. K\u0151v\u00e1ri, V. T. S\u00f3s and P. Tur\u00e1n: On a problem of K. Zarankiewicz, Colloq. Math. 3 (1954), 50\u201357.","journal-title":"Colloq. Math."},{"issue":"5","key":"2154_CR21","doi-asserted-by":"crossref","first-page":"1557","DOI":"10.1137\/S009753970038211X","volume":"31","author":"I. Newman","year":"2002","unstructured":"I. Newman: Testing membership in languages that have small width branching programs, SIAM J. of Computing 31(5) (2002), 1557\u20131570.","journal-title":"SIAM J. of Computing"},{"key":"2154_CR22","doi-asserted-by":"crossref","unstructured":"D. Ron: Property testing (a tutorial), in: Handbook of Randomized Computing (S. Rajasekaran, P. M. Pardalos, J. H. Reif and J. D. P. Rolim eds.), Vol. II, Chapter 15, Kluwer Press, 2001.","DOI":"10.1007\/978-1-4615-0013-1_15"},{"issue":"2","key":"2154_CR23","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1137\/S0097539793255151","volume":"25","author":"R. Rubinfeld","year":"1996","unstructured":"R. Rubinfeld and M. Sudan: Robust characterization of polynomials with applications to program testing, SIAM J. of Computing 25(2) (1996), 252\u2013271.","journal-title":"SIAM J. of Computing"},{"key":"2154_CR24","unstructured":"E. Szemer\u00e9di: Regular partitions of graphs, in: Proc. Colloque Inter. CNRS No. 260 (J. C. Bermond, J. C. Fournier, M. Las Vergnas and D. Sotteau eds.), pages 399\u2013401, 1978."},{"key":"2154_CR25","doi-asserted-by":"crossref","unstructured":"A. C. Yao: Probabilistic computation, towards a unified measure of complexity; in: 18th IEEE FOCS Conference Proceedings, pages 222\u2013227, 1977.","DOI":"10.1109\/SFCS.1977.24"},{"key":"2154_CR26","first-page":"116","volume":"2","author":"K. Zarankiewicz","year":"1951","unstructured":"K. Zarankiewicz: Problem P 101, Colloq. Math. 2 (1951), 116\u2013131.","journal-title":"Colloq. Math."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-007-2154-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-007-2154-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-007-2154-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T21:32:45Z","timestamp":1559079165000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-007-2154-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,5]]},"references-count":26,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2007,5]]}},"alternative-id":["2154"],"URL":"https:\/\/doi.org\/10.1007\/s00493-007-2154-3","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,5]]}}}