乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,11,19]],"date-time":"2024-11-19T15:49:45Z","timestamp":1732031385618,"version":"3.28.0"},"publisher-location":"New York, NY, USA","reference-count":45,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2001,7]]},"DOI":"10.1145\/384101.384126","type":"proceedings-article","created":{"date-parts":[[2003,11,25]],"date-time":"2003-11-25T17:11:45Z","timestamp":1069780305000},"page":"183-191","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Strongly-local reductions and the complexity\/efficient approximability of algebra and optimization on abstract algebraic structures"],"prefix":"10.1145","author":[{"suffix":"III","given":"Harry B.","family":"Hunt","sequence":"first","affiliation":[{"name":"Univ. at Albany-State Univ. of New York, Albany"}]},{"given":"Madhav V.","family":"Marathe","sequence":"additional","affiliation":[{"name":"Univ. at Albany-State Univ. of New York, Albany"}]},{"given":"Richard E.","family":"Stearns","sequence":"additional","affiliation":[{"name":"Univ. at Albany-State Univ. of New York, Albany"}]}],"member":"320","published-online":{"date-parts":[[2001,7]]},"reference":[{"key":"e_1_3_2_1_1_2","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1472"},{"key":"e_1_3_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(94)00254-G"},{"volume-title":"Compilers principles, techniques, and tools","year":"1986","key":"e_1_3_2_1_3_2","unstructured":"A.V.Aho, R.Sethi, and J.D.Ullman. Compilers principles, techniques, and tools , Addison Wesley , Reading, MA , 1986 . A.V.Aho, R.Sethi, and J.D.Ullman. Compilers principles, techniques, and tools, Addison Wesley, Reading, MA, 1986."},{"key":"e_1_3_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(91)90006-K"},{"key":"e_1_3_2_1_5_2","volume-title":"Algorithms in Real Algebraic Geometry","author":"Arnon D.","year":"1988","unstructured":"D. Arnon and B. Buchberger(Editors) , Algorithms in Real Algebraic Geometry , Academic Press , London , 1988 . D. Arnon and B. Buchberger(Editors), Algorithms in Real Algebraic Geometry, Academic Press, London, 1988."},{"key":"e_1_3_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1145\/278298.278306"},{"key":"e_1_3_2_1_7_2","volume-title":"Lattice theory","year":"1966","unstructured":"G.Birkhoff , Lattice theory ,( 3 rd ed.), American Mathematics Society , Providence, RI , 1966 . G.Birkhoff, Lattice theory,(3rd ed.), American Mathematics Society, Providence, RI, 1966.","edition":"3"},{"key":"e_1_3_2_1_8_2","volume-title":"Model checking. Preliminary unpublished version","author":"Clarke E.","year":"1998","unstructured":"E. Clarke , O. Grumberg , and D. Peled . Model checking. Preliminary unpublished version , 1998 . E. Clarke, O. Grumberg, and D. Peled. Model checking. Preliminary unpublished version, 1998."},{"issue":"4","key":"e_1_3_2_1_9_2","volume":"1995","author":"Condon A.","unstructured":"A. Condon , J. Feigenbaum , C. Lund and P. Shot . Probabilistically checkable debate systems and approximation algorithms for PSPACE-hard functions. Chicago Journal of Theoretical Computer Science , Vol. 1995 , No. 4 . A. Condon, J. Feigenbaum, C. Lund and P. Shot. Probabilistically checkable debate systems and approximation algorithms for PSPACE-hard functions. Chicago Journal of Theoretical Computer Science, Vol. 1995, No. 4.","journal-title":"Chicago Journal of Theoretical Computer Science"},{"key":"e_1_3_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793260738"},{"key":"e_1_3_2_1_11_2","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1995.1087"},{"key":"e_1_3_2_1_12_2","volume-title":"American Mathematical Monthly (AMM)","author":"Davis M.","year":"1973","unstructured":"M. Davis . Hilbert's tenth problem is undecidable . American Mathematical Monthly (AMM) , 1973 . M. Davis. Hilbert's tenth problem is undecidable. American Mathematical Monthly (AMM), 1973."},{"volume-title":"Automata, languages, and machines","author":"Eilenberg S.","key":"e_1_3_2_1_13_2","unstructured":"S. Eilenberg , Automata, languages, and machines , vol. A, Academic Press, NY, 1974 . S. Eilenberg, Automata, languages, and machines, vol. A, Academic Press, NY, 1974."},{"key":"e_1_3_2_1_14_2","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey M.","year":"1979","unstructured":"M. Garey and D. Johnson . Computers and Intractability: A Guide to the Theory of NP-Completeness , W. H. Freeman , San Francisco , 1979 . M. Garey and D. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman, San Francisco, 1979."},{"key":"e_1_3_2_1_15_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.1986.1270196"},{"key":"e_1_3_2_1_16_2","volume-title":"Approximation algorithms for NP-hard problems","author":"Ed D.","year":"1997","unstructured":"D. Hochbaum( Ed .). Approximation algorithms for NP-hard problems , PWS Publishing Company , Boston, MA , 1997 . D. Hochbaum(Ed.). Approximation algorithms for NP-hard problems, PWS Publishing Company, Boston, MA, 1997."},{"key":"e_1_3_2_1_17_2","doi-asserted-by":"publisher","DOI":"10.1006\/inco.2002.2903"},{"key":"e_1_3_2_1_18_2","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793304601"},{"key":"e_1_3_2_1_19_2","doi-asserted-by":"publisher","DOI":"10.1137\/0216059"},{"key":"e_1_3_2_1_20_2","volume-title":"Relational representability, local reductions, and the complexity of generalized satisfiability problems. Submitted for publication","author":"H.B.","year":"2000","unstructured":"H.B. Hunt III, R.E. Stearns , and M.V. Marathe . Relational representability, local reductions, and the complexity of generalized satisfiability problems. Submitted for publication , 2000 . H.B. Hunt III, R.E. Stearns, and M.V. Marathe. Relational representability, local reductions, and the complexity of generalized satisfiability problems. Submitted for publication, 2000."},{"key":"e_1_3_2_1_21_2","volume-title":"Analysis of Numerical Methods","author":"Isaacson E.","year":"1994","unstructured":"E. Isaacson and H. Keller . Analysis of Numerical Methods . Dover Publishing, NY , 1994 . This is a corrected unabridged republication of the work under the same title by John Wiley & amp; Sons, NY, 1966. E. Isaacson and H. Keller. Analysis of Numerical Methods. Dover Publishing, NY, 1994. This is a corrected unabridged republication of the work under the same title by John Wiley & Sons, NY, 1966."},{"key":"e_1_3_2_1_22_2","doi-asserted-by":"publisher","DOI":"10.1145\/263867.263489"},{"key":"e_1_3_2_1_23_2","first-page":"221","volume-title":"There cannot be any algorithm for integer programming with quadratic constraints. Operations Research (OR), 21","author":"Jeroslow R.","unstructured":"R. Jeroslow . There cannot be any algorithm for integer programming with quadratic constraints. Operations Research (OR), 21 , pp. 221 - 224 . R. Jeroslow. There cannot be any algorithm for integer programming with quadratic constraints. Operations Research (OR), 21, pp. 221-224."},{"key":"e_1_3_2_1_24_2","doi-asserted-by":"publisher","DOI":"10.1145\/237814.237979"},{"key":"e_1_3_2_1_25_2","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258538"},{"key":"e_1_3_2_1_26_2","doi-asserted-by":"publisher","DOI":"10.1137\/0218073"},{"key":"e_1_3_2_1_27_2","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(92)90004-3"},{"key":"e_1_3_2_1_28_2","doi-asserted-by":"publisher","DOI":"10.1287\/moor.8.4.538"},{"key":"e_1_3_2_1_29_2","first-page":"329","volume-title":"May 1982","author":"Lichtenstein D.","unstructured":"D. Lichtenstein . Planar formulae and their uses. SIAM J. Computing (SICOMP), Vol 11, No. 2 , May 1982 , pp. 329 - 343 . D. Lichtenstein. Planar formulae and their uses. SIAM J. Computing (SICOMP), Vol 11, No. 2, May 1982 , pp. 329-343."},{"key":"e_1_3_2_1_30_2","volume-title":"Algebra","author":"MacLane S.","year":"1967","unstructured":"S. MacLane and G. Birkhoff , Algebra , Macmillan , NY 1967 . S. MacLane and G. Birkhoff, Algebra, Macmillan, NY 1967."},{"key":"e_1_3_2_1_31_2","volume-title":"Proe. 13th IEEE Conf. on Computational Complexity.","author":"Marathe M.","year":"1998","unstructured":"M. Marathe , H. Hunt III, D. Rosenkrantz and R. Stearns . Theory of periodically specified problems:complexity and approximability . Proe. 13th IEEE Conf. on Computational Complexity. 1998 . M. Marathe, H. Hunt III, D. Rosenkrantz and R. Stearns. Theory of periodically specified problems:complexity and approximability. Proe. 13th IEEE Conf. on Computational Complexity. 1998."},{"key":"e_1_3_2_1_32_2","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795285254"},{"key":"e_1_3_2_1_33_2","first-page":"279","volume":"191","author":"Matiyasevic Y.","year":"1970","unstructured":"Y. Matiyasevic , Enumerable sets are Diophantine(Russian). Dokl. Akad. Nauk SSSR , 191 , 1970 , pp. 279 - 282 . Improved English translation:Soviet Math. Doklady, 11, 1970, pp. 354-357. Y. Matiyasevic, Enumerable sets are Diophantine(Russian). Dokl. Akad. Nauk SSSR, 191, 1970, pp.279-282. Improved English translation:Soviet Math. Doklady, 11, 1970, pp. 354-357.","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"e_1_3_2_1_34_2","doi-asserted-by":"publisher","DOI":"10.1145\/800076.802475"},{"key":"e_1_3_2_1_35_2","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(93)90259-V"},{"key":"e_1_3_2_1_36_2","first-page":"425","volume":"43","author":"Papadimitriou C.","year":"1991","unstructured":"C. Papadimitriou and M. Yannakakis . Optimization, approximation, and complexity classes. J. Computer and System Sciences (JCSS) , 43 , 1991 , pp. 425 - 440 . C. Papadimitriou and M. Yannakakis. Optimization, approximation, and complexity classes. J. Computer and System Sciences (JCSS), 43, 1991, pp. 425-440.","journal-title":"Optimization, approximation, and complexity classes. J. Computer and System Sciences (JCSS)"},{"key":"e_1_3_2_1_37_2","first-page":"323","volume-title":"Efficient algorithms for 6-near-planar graph and algebraic problems. Complexity in Numerical Optimization, (Edited by P.M. Pardalos)","author":"Radhakrishnan V.","year":"1993","unstructured":"V. Radhakrishnan , H.B. Hunt III, and R.E. Stearns . Efficient algorithms for 6-near-planar graph and algebraic problems. Complexity in Numerical Optimization, (Edited by P.M. Pardalos) , World Scientific Publishing Co. , 1993 , pp. 323 - 350 . V. Radhakrishnan, H.B. Hunt III, and R.E. Stearns. Efficient algorithms for 6-near-planar graph and algebraic problems. Complexity in Numerical Optimization, (Edited by P.M. Pardalos), World Scientific Publishing Co., 1993, pp. 323-350."},{"key":"e_1_3_2_1_38_2","volume-title":"Symbolic Dynamics, and Chaos","author":"Robinson C.","year":"1999","unstructured":"C. Robinson . Dynamical Systems Stability , Symbolic Dynamics, and Chaos Second Edition. CRC Press Boca Raton , Florida , 1999 . C. Robinson. Dynamical Systems Stability, Symbolic Dynamics, and Chaos Second Edition. CRC Press Boca Raton, Florida, 1999."},{"key":"e_1_3_2_1_39_2","doi-asserted-by":"publisher","DOI":"10.1145\/800133.804350"},{"key":"e_1_3_2_1_40_2","doi-asserted-by":"publisher","DOI":"10.1145\/322047.322060"},{"key":"e_1_3_2_1_41_2","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793243004"},{"key":"e_1_3_2_1_42_2","volume-title":"Dipartimento di Seienze dell'Informazione","author":"Trevisan L.","year":"1997","unstructured":"L. Trevisan , Reductions and (Non-)Approximability, Ph. D. Thesis , Dipartimento di Seienze dell'Informazione , University of Rome , \"La Sapienza\", Italy, 1997 . L. Trevisan, Reductions and (Non-)Approximability, Ph.D. Thesis, Dipartimento di Seienze dell'Informazione, University of Rome, \"La Sapienza\", Italy, 1997."},{"key":"e_1_3_2_1_43_2","volume-title":"Computer Science Press","author":"Ullman J.D.","year":"1989","unstructured":"J.D. Ullman . Principles of Database and Knowledge Base Systems, Vols. I and II , Computer Science Press , Rockville, Maryland , 1989 . J.D. Ullman. Principles of Database and Knowledge Base Systems, Vols. I and II, Computer Science Press, Rockville, Maryland, 1989."},{"key":"e_1_3_2_1_44_2","first-page":"410","volume-title":"August 1979","author":"Valiant L.G.","unstructured":"L.G. Valiant . The complexity of enumeration and reliability problems, SIAM J. Computing (SICOMP), Vol 8, No. 3 , August 1979 , pp. 410 - 421 . L.G. Valiant. The complexity of enumeration and reliability problems, SIAM J. Computing (SICOMP), Vol 8, No. 3, August 1979 , pp. 410-421."},{"key":"e_1_3_2_1_45_2","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539794266407"}],"event":{"name":"ISSAC01: International Symposium on Symbolic and Algebraic Computation","sponsor":["SIGSAM ACM Special Interest Group on Symbolic and Algebraic Manipulation"],"location":"London Ontario Canada","acronym":"ISSAC01"},"container-title":["Proceedings of the 2001 international symposium on Symbolic and algebraic computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/384101.384126","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,11]],"date-time":"2023-01-11T06:28:39Z","timestamp":1673418519000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/384101.384126"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,7]]},"references-count":45,"alternative-id":["10.1145\/384101.384126","10.1145\/384101"],"URL":"https:\/\/doi.org\/10.1145\/384101.384126","relation":{},"subject":[],"published":{"date-parts":[[2001,7]]},"assertion":[{"value":"2001-07-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}