乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,2]],"date-time":"2023-09-02T17:49:20Z","timestamp":1693676960482},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,12,18]],"date-time":"2012-12-18T00:00:00Z","timestamp":1355788800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["comput. complex."],"published-print":{"date-parts":[[2013,3]]},"DOI":"10.1007\/s00037-012-0055-3","type":"journal-article","created":{"date-parts":[[2012,12,17]],"date-time":"2012-12-17T06:52:49Z","timestamp":1355727169000},"page":"137-158","source":"Crossref","is-referenced-by-count":2,"title":["2-Transitivity is Insufficient for Local Testability"],"prefix":"10.1007","volume":"22","author":[{"given":"Elena","family":"Grigorescu","sequence":"first","affiliation":[]},{"given":"Tali","family":"Kaufman","sequence":"additional","affiliation":[]},{"given":"Madhu","family":"Sudan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,12,18]]},"reference":[{"issue":"1","key":"55_CR1","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1137\/060667177","volume":"39","author":"Alon Noga","year":"2009","unstructured":"Noga Alon, Eldar Fischer, IlanNewman Asaf Shapira (2009) A Combinatorial Characterization of the Testable Graph Properties: It\u2019s All About Regularity. SIAM Journal of Computing 39(1): 143\u2013167","journal-title":"SIAM Journal of Computing"},{"issue":"11","key":"55_CR2","doi-asserted-by":"crossref","first-page":"4032","DOI":"10.1109\/TIT.2005.856958","volume":"51","author":"Alon Noga","year":"2005","unstructured":"Noga Alon, Tali Kaufman, Michael Krivelevich, Simon Litsyn, Dana Ron (2005) Testing Reed-Muller codes. IEEE Transactions on Information Theory 51(11): 4032\u20134039","journal-title":"IEEE Transactions on Information Theory"},{"issue":"3","key":"55_CR3","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1145\/278298.278306","volume":"45","author":"Arora Sanjeev","year":"1998","unstructured":"Sanjeev Arora, Carsten Lund, Rajeev Motwani, Madhu Sudan, Mario Szegedy (1998) Proof verification and the hardness of approximation problems. Journal of the ACM 45(3): 501\u2013555","journal-title":"Journal of the ACM"},{"issue":"1","key":"55_CR4","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1145\/273865.273901","volume":"45","author":"Arora Sanjeev","year":"1998","unstructured":"Sanjeev Arora, Shmuel Safra (1998) Probabilistic checking of proofs: A new characterization of NP. Journal of the ACM 45(1): 70\u2013122","journal-title":"Journal of the ACM"},{"key":"55_CR5","doi-asserted-by":"crossref","unstructured":"L\u00e1szl\u00f3 Babai, Lance Fortnow, Leonid A. Levin, Mario Szegedy (1991a). Checking computations in polylogarithmic time. In The Annual ACM Symposium on Theory of Computing, 21\u201332.","DOI":"10.1145\/103418.103428"},{"issue":"1","key":"55_CR6","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/BF01200056","volume":"1","author":"Babai L\u00e1szl\u00f3","year":"1991","unstructured":"L\u00e1szl\u00f3 Babai, Lance Fortnow & Carsten Lund (1991b). Non-Deterministic Exponential Time has Two-Prover Interactive Protocols. Computational Complexity 1(1): 3\u201340","journal-title":"Computational Complexity"},{"key":"55_CR7","doi-asserted-by":"crossref","unstructured":"Eli Ben-Sasson, Elena Grigorescu, Ghid Maatouk, Amir Shpilka, Madhu Sudan (2011a). On Sums of Locally Testable Affine Invariant Properties. Electronic Colloquium on Computational Complexity (ECCC) 18, 79. (Conference version appeared in RANDOM, 2011).","DOI":"10.1007\/978-3-642-22935-0_34"},{"issue":"1","key":"55_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/S0097539704445445","volume":"35","author":"Ben-Sasson Eli","year":"2005","unstructured":"Eli Ben-Sasson, Prahladh Harsha, Sofya Raskhodnikova (2005) Some 3CNF properties are hard to test. SIAM Journal on Computing 35(1): 1\u201321","journal-title":"SIAM Journal on Computing"},{"key":"55_CR9","doi-asserted-by":"crossref","unstructured":"Eli Ben-Sasson, Ghid Maatouk, Amir Shpilka, Madhu Sudan (2011b). Symmetric LDPC Codes are not Necessarily Locally Testable. In IEEE Conference on Computational Complexity, 55\u201365.","DOI":"10.1109\/CCC.2011.14"},{"issue":"3","key":"55_CR10","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1016\/0022-0000(93)90044-W","volume":"47","author":"Blum Manuel","year":"1993","unstructured":"Manuel Blum, Michael Luby, Ronitt Rubinfeld (1993) Self-Testing\/Correcting with Applications to Numerical Problems. Journal of Computer and System Sciences 47(3): 549\u2013595","journal-title":"Journal of Computer and System Sciences"},{"key":"55_CR11","doi-asserted-by":"crossref","unstructured":"Christian Borgs, Jennifer T. Chayes, L\u00e1szl\u00f3 Lov\u00e1sz, Vera T. S\u00f3s, Bal\u00e1zs Szegedy, Katalin Vesztergombi (2006). Graph limits and parameter testing. In The Annual ACM Symposium on Theory of Computing, 261\u2013270.","DOI":"10.1145\/1132516.1132556"},{"issue":"2","key":"55_CR12","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1145\/226643.226652","volume":"43","author":"Feige Uriel","year":"1996","unstructured":"Uriel Feige, Shafi Goldwasser, L\u00e1szl\u00f3 Lov\u00e1sz, Shmuel Safra, Mario Szegedy (1996). Interactive proofs and the hardness of approximating cliques. Journal of the ACM 43(2): 268\u2013292","journal-title":"Journal of the ACM"},{"key":"55_CR13","doi-asserted-by":"crossref","unstructured":"Oded Goldreich, Shafi Goldwasser, Dana Ron (1998). Property testing and its connection to learning and approximation. Journal of the ACM 45(4), 653\u2013750. ISSN 0004-5411.","DOI":"10.1145\/285055.285060"},{"key":"55_CR14","unstructured":"Elena Grigorescu (2010). Symmetries in Algebraic Property Testing. Ph.D. thesis, MIT."},{"key":"55_CR15","doi-asserted-by":"crossref","unstructured":"Elena Grigorescu, Tali Kaufman, Madhu Sudan (2009). Succinct representation of codes with applications to testing. In Proceedings of RANDOM-APPROX 2009, volume 5687 of Lecture Notes in Computer Science, 534\u2013547. Springer.","DOI":"10.1007\/978-3-642-03685-9_40"},{"key":"55_CR16","doi-asserted-by":"crossref","unstructured":"Tali Kaufman, Shachar Lovett (2011). New Extension of the Weil Bound for Character Sums with Applications to Coding. In The Annual IEEE Symposium on Foundations of Computer Science, 788\u2013796.","DOI":"10.1109\/FOCS.2011.41"},{"issue":"3","key":"55_CR17","doi-asserted-by":"crossref","first-page":"779","DOI":"10.1137\/S0097539704445615","volume":"36","author":"Kaufman Tali","year":"2006","unstructured":"Tali Kaufman, Dana Ron (2006) Testing Polynomials over General Fields. SIAM Journal of Computing. 36(3): 779\u2013802","journal-title":"SIAM Journal of Computing."},{"key":"55_CR18","doi-asserted-by":"crossref","unstructured":"Tali Kaufman, Madhu Sudan (2008). Algebraic property testing: the role of invariance. In The Annual ACM Symposium on Theory of Computing, 403\u2013412.","DOI":"10.1145\/1374376.1374434"},{"key":"55_CR19","volume-title":"The Theory of Error-Correcting Codes","author":"MacWilliams F. J.","year":"1981","unstructured":"F. J. MacWilliams, NeilJ. A. Sloane (1981) The Theory of Error-Correcting Codes. Elsevier\/North-Holland, Amsterdam"},{"issue":"2","key":"55_CR20","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1137\/S0097539793255151","volume":"25","author":"Rubinfeld Ronitt","year":"1996","unstructured":"Ronitt Rubinfeld, Madhu Sudan (1996) Robust characterizations of polynomials with applications to program testing. SIAM Journal on Computing 25(2): 252\u2013271","journal-title":"SIAM Journal on Computing"}],"container-title":["computational complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00037-012-0055-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00037-012-0055-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00037-012-0055-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,3]],"date-time":"2022-02-03T14:01:52Z","timestamp":1643896912000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00037-012-0055-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,12,18]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,3]]}},"alternative-id":["55"],"URL":"https:\/\/doi.org\/10.1007\/s00037-012-0055-3","relation":{},"ISSN":["1016-3328","1420-8954"],"issn-type":[{"value":"1016-3328","type":"print"},{"value":"1420-8954","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,12,18]]}}}