{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T18:00:55Z","timestamp":1787508055671,"version":"build-2736575974"},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540663294","type":"print"},{"value":"9783540484134","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/978-3-540-48413-4_25","type":"book-chapter","created":{"date-parts":[[2011,1,14]],"date-time":"2011-01-14T07:52:41Z","timestamp":1294991561000},"page":"245-256","source":"Crossref","is-referenced-by-count":14,"title":["Fast Approximate PCPs for Multidimensional Bin-Packing Problems"],"prefix":"10.1007","author":[{"given":"Tu\u011fkan","family":"Batu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ronitt","family":"Rubinfeld","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Patrick","family":"White","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"3","key":"25_CR1","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1145\/278298.278306","volume":"45","author":"S. Arora","year":"1998","unstructured":"Arora, S., Lund, C., Motwani, R., Sudan, M., Szegedy, M.: Proof verification and hardness of approximation problems. J. of the ACM\u00a045(3), 501\u2013555 (1998)","journal-title":"J. of the ACM"},{"key":"25_CR2","unstructured":"Batu, T., Rubinfeld, R., White, P.: Fast approximate PCPs for multidimensional bin-packing problems, http:\/\/simon.cs.cornell.edu\/home\/ronitt\/PAP\/bin.ps"},{"key":"25_CR3","doi-asserted-by":"crossref","unstructured":"Babai, L., Fortnow, L., Lund, C.: Non-deterministic exponential time has two-prover interactive protocols. Computational Complexity, 3\u201340 (1991)","DOI":"10.1007\/BF01200056"},{"key":"25_CR4","doi-asserted-by":"crossref","unstructured":"Babai, L., Fortnow, L., Lund, C., Szegedy, M.: Checking computations in polylogarithmic time. In: Proc. 31st Foundations of Computer Science, pp. 16\u201325 (1990)","DOI":"10.1145\/103418.103428"},{"key":"25_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/978-3-540-48413-4_10","volume-title":"Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques","author":"Y. Dodis","year":"1999","unstructured":"Dodis, Y., Goldreich, O., Lehman, E., Raskhodnikova, S., Ron, D., Samorodnitsky, A.: Improved Testing Algorithms for Monotonicity. In: Hochbaum, D.S., Jansen, K., Rolim, J.D.P., Sinclair, A. (eds.) RANDOM 1999 and APPROX 1999. LNCS, vol.\u00a01671, pp. 97\u2013108. Springer, Heidelberg (1999)"},{"key":"25_CR6","doi-asserted-by":"crossref","unstructured":"Ergun, F., Kannan, S., Kumar, R., Rubinfeld, R., Viswanathan, M.: Spot-checkers. In: Proc. 30th Symposium on Theory of Computing, pp. 259\u2013268 (1998)","DOI":"10.1145\/276698.276757"},{"key":"25_CR7","unstructured":"Erg\u00fcn, F., Kumar, R., Rubinfeld, R.: Fast PCPs for approximations. In: Proc. 31st Symposium on Theory of Computing (1999)"},{"issue":"2","key":"25_CR8","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1016\/0304-3975(94)90251-8","volume":"134","author":"L. Fortnow","year":"1994","unstructured":"Fortnow, L., Rompel, J., Sipser, M.: On the power of multi-prover interactive protocols. Theoretical Computer Science\u00a0134(2), 545\u2013557 (1994)","journal-title":"Theoretical Computer Science"},{"key":"25_CR9","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Goldwasser, S., Lehman, E., Ron, D.: Testing Monotonicity. In: Proc. 39th Symposium on Foundations of Computer Science (1998)","DOI":"10.1109\/SFCS.1998.743493"}],"container-title":["Lecture Notes in Computer Science","Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-48413-4_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,17]],"date-time":"2021-11-17T06:35:33Z","timestamp":1637130933000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-48413-4_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540663294","9783540484134"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-48413-4_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1999]]}}}