{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,27]],"date-time":"2025-06-27T19:25:47Z","timestamp":1751052347182},"publisher-location":"Berlin, Heidelberg","reference-count":65,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642688768"},{"type":"electronic","value":"9783642688744"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1983]]},"DOI":"10.1007\/978-3-642-68874-4_19","type":"book-chapter","created":{"date-parts":[[2011,10,25]],"date-time":"2011-10-25T17:36:08Z","timestamp":1319564168000},"page":"501-529","source":"Crossref","is-referenced-by-count":12,"title":["Generalized Gradient Methods of Nondifferentiable Optimization Employing Space Dilatation Operations"],"prefix":"10.1007","author":[{"given":"N. Z.","family":"Shor","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","first-page":"247","volume-title":"Methodology and Attempted Solution of Large Network Transportation Problems by Computer. - In the Book: Mathematical Methods for Production Problems","author":"AA Bakaev","year":"1963","unstructured":"A. A. Bakaev, V. S. Mikhalevich, S. V. Branovickaja, N. Z. Shor. Methodology and Attempted Solution of Large Network Transportation Problems by Computer. - In the Book: Mathematical Methods for Production Problems, M., 1963, pp. 247\u2013257."},{"issue":"1","key":"19_CR2","first-page":"137","volume":"14","author":"LV Beljaeva","year":"1978","unstructured":"L. V. Beljaeva, N. T. Zhurbenko, N. Z. Shor. Concerning Methods of Solution of One Class of Dynamic Distribution Problems. - Economics and Mathematical Methods, 1978, Vol. 14, Issue 1, pp. 137\u2013146.","journal-title":"Concerning Methods of Solution of One Class of Dynamic Distribution Problems. - Economics and Mathematical Methods"},{"key":"19_CR3","first-page":"35","volume-title":"Iterative Method of Solution of General Problem of Linear Programming. - In Coll.: Numerical Methods of Optimal Planning, Issue 1, Econ.- Math","author":"VA Bulavskij","year":"1962","unstructured":"V. A. Bulavskij. Iterative Method of Solution of General Problem of Linear Programming. - In Coll.: Numerical Methods of Optimal Planning, Issue 1, Econ.- Math. Ser., Siberian Branch of Ac. Sci. U.S.S.R., 1962, pp. 35\u201364."},{"key":"19_CR4","first-page":"178","volume-title":"Computational Methods of Choice of Optimal Design Decisions","author":"VS Mikhalevich","year":"1977","unstructured":"V. S. Mikhalevich, N. Z. Shor, L. A. Galustova, et al. Computational Methods of Choice of Optimal Design Decisions. - Kiev, Naukova Dumka, 1977, 178 p."},{"key":"19_CR5","first-page":"15","volume-title":"the Book: Theory of Optimal Solutions, Kiev, Inst, of Cybernetics. Ac","author":"VI Gershovich","year":"1979","unstructured":"V. I. Gershovich. About a Cutting Method with Linear Space Transformations. In the Book: Theory of Optimal Solutions, Kiev, Inst, of Cybernetics. Ac. Sci. Ukr.S.S.R., 1979, pp. 15\u201323."},{"key":"19_CR6","first-page":"64","volume-title":"the Book: Numerical Methods of Nonlinear Programming","author":"VI Gershovich","year":"1979","unstructured":"V. I. Gershovich. One Way of Representing Space Transformation Operators in High-Speed Versions of Generalized Gradient Methods. In the Book: Numerical Methods of Nonlinear Programming. Summaries of Papers at the III. All-Union Seminar. - Kharkov, 1979, pp. 64\u201366."},{"key":"19_CR7","first-page":"50","volume-title":"that Combines Cutting Methods and Linear Transformations in Variable Space. - In the Book: Systems of Software Support for Solution of Optimal Planning Problems","author":"V. I. Gershovich. Efficient Algorithm for Solving Problems of Nonsmooth Optimization","year":"1980","unstructured":"V. I. Gershovich. Efficient Algorithm for Solving Problems of Nonsmooth Optimization that Combines Cutting Methods and Linear Transformations in Variable Space. - In the Book: Systems of Software Support for Solution of Optimal Planning Problems. Summaries of Papers at the IV. Ail-Union Symposium.-M., 1980, pp. 50\u201351."},{"key":"19_CR8","first-page":"38","volume-title":"One Optimization Method Using Linear Space Transformations. - In the Book: Theory of Optimal Solutions. Kiev","author":"VI Gershovich","year":"1980","unstructured":"V. I. Gershovich. One Optimization Method Using Linear Space Transformations. - In the Book: Theory of Optimal Solutions. Kiev, Inst, of Cybernetics, Ac. Sci. Ukr. S.S.R., 1980, pp. 38\u201345."},{"key":"19_CR9","first-page":"8","volume-title":"the Book: Some Algorithms of Nonsmooth Optimization and Discrete Programming. Preprint","author":"VI Gershovich","year":"1981","unstructured":"V. I. Gershovich. About an Ellipsoid Algorithm. In the Book: Some Algorithms of Nonsmooth Optimization and Discrete Programming. Preprint 81-6 Inst, of Cybernetics, Ac. Sci. Ukr.S.S.R., 1981, pp. 8\u201313."},{"key":"19_CR10","first-page":"188","volume-title":"the Book: II","author":"VI Gershovich","year":"1981","unstructured":"V. I. Gershovich. Quadratic Smoothing in Iterative Decomposition Algorithms of Solution of Large-Scale Linear-Programming Problems. In the Book: II. Republican Symposium on Methods of Solution of Nonlinear Equations and Optimization Problems. Tallin, 1981, pp. 188\u2013190."},{"key":"19_CR11","first-page":"149","volume-title":"Gupal. Stochastic Methods of Solution of Nonsmooth Extremum Problems","author":"A. M","year":"1979","unstructured":"A. M. Gupal. Stochastic Methods of Solution of Nonsmooth Extremum Problems. - Kiev, Naukova Dumka, 1979, 149 p."},{"key":"19_CR12","first-page":"368","volume-title":"V. N. Malozemov","author":"VV Dem\u2019janov","year":"1972","unstructured":"V. V. Dem\u2019janov, V. N. Malozemov. Introduction to Minimax - M., Nauka, 1972, 368 p."},{"key":"19_CR13","first-page":"384","volume-title":"L. V. Vasilev. Non-Differentiable Optimization","author":"VF Dem\u2019janov","year":"1981","unstructured":"V. F. Dem\u2019janov, L. V. Vasil\u2019ev. Non-Differentiable Optimization. - M., Nauka, 1981, 384 p."},{"issue":"6","key":"19_CR14","first-page":"1254","volume":"143","author":"II Eremin","year":"1962","unstructured":"I. I. Eremin. Iterative Method for Tchebycheff Approximations of Inconsistent Systems of Linear Inequalities. - Dokl. AN S.S.S.R., 1962, Vol. 143, No. 6, pp. 1254\u20131256.","journal-title":"Dokl AN S.S.S.R."},{"key":"19_CR15","first-page":"63","volume":"4","author":"I. I","year":"1967","unstructured":"I. I. Eremin. About \u201cPenalty \u201d Method in Convex Programming. - Kybernetika, 1967, No. 4, pp. 63\u201367.","journal-title":"Method in Convex Programming. - Kybernetika"},{"issue":"2","key":"19_CR16","first-page":"217","volume":"3","author":"II Eremin","year":"1968","unstructured":"I. I. Eremin. Methods of Fejer Approximations in Convex Programming. Mathem. Notes, 1968, Vol. 3, No. 2, pp. 217\u2013234.","journal-title":"Mathem. Notes"},{"key":"19_CR17","first-page":"240","volume-title":"Stochastic Programming Methods","author":"Ju. M. Ermol\u2019jev","year":"1976","unstructured":"Ju. M. Ermol\u2019jev. Stochastic Programming Methods, M., Nauka, 1976, 240 p."},{"key":"19_CR18","first-page":"1","volume":"4","author":"Ju. M","year":"1966","unstructured":"Ju. M. Ermol\u2019jev. Methods of Solution of Nonlinear Extremum Problems. - Kiber- netika, 1966, No. 4, pp. 1\u201317.","journal-title":"- Kiber- netika"},{"issue":"6","key":"19_CR19","first-page":"1244","volume":"160","author":"AJ Levin","year":"1965","unstructured":"A. Ju. Levin. On an Algorithm for Minimization of Convex Functions. - Dokl. AN S.S.S.R., 1965, Vol. 160, No. 6, pp. 1244\u20131247.","journal-title":"Dokl AN S.S.S.R."},{"key":"19_CR20","first-page":"75","volume":"4","author":"AS Nemirovskij","year":"1977","unstructured":"A. S. Nemirovskij, D. B. Judin. Optimization Methods Adaptive to \u201cConsiderable \u201d Dimension of a Problem. - Avtomatika i Telemekhanika, 1977, No. 4, pp. 75\u201387.","journal-title":"Dimension of a Problem. - Avtomatika i Telemekhanika"},{"key":"19_CR21","first-page":"383","volume-title":"D. B. Judin. Complexity of Problems and Efficiency of Optimization Methods","author":"NS Nemirovskij","year":"1979","unstructured":"N. S. Nemirovskij, D. B. Judin. Complexity of Problems and Efficiency of Optimization Methods. - M., Nauka, 1979, 383 p."},{"key":"19_CR22","first-page":"159","volume-title":"Nurminskij. Numerical Methods of Solution of Deterministic and Stochastic Minimax Problems","author":"E. A","year":"1979","unstructured":"E. A. Nurminskij. Numerical Methods of Solution of Deterministic and Stochastic Minimax Problems. - Kiev. Naukova Dumka, 1979, 159 p."},{"key":"19_CR23","first-page":"148","volume":"5","author":"EA Nurminskij","year":"1977","unstructured":"E. A. Nurminskij. About Continuity of e-Subgradient Mappings. - Kibernetika, 1977, No. 5, pp. 148\u2013149.","journal-title":"Kibernetika"},{"issue":"1","key":"19_CR24","first-page":"33","volume":"174","author":"BT Poljak","year":"1967","unstructured":"B. T. Poljak. A General Method of Solution of Extremum Problems. - Dokl. AN S.S.S.R., 1967, Vol. 174, No. 1, pp. 33\u201336.","journal-title":"Dokl. AN S.S.S.R."},{"issue":"3","key":"19_CR25","first-page":"509","volume":"9","author":"BT Poljak","year":"1969","unstructured":"B. T. Poljak. Minimization of Unsmooth Functionals. - J. Vychisl. Matem. i Mat. Fiziki, 1969, Vol. 9, No. 3, pp. 509\u2013521.","journal-title":"J. Vychisl. Matem. i Mat. Fiziki"},{"key":"19_CR26","first-page":"319","volume-title":"Ju. M. Danilin. Numerical Methods for Extremum Problems","author":"BN Pshenichnyj","year":"1975","unstructured":"B. N. Pshenichnyj, Ju. M. Danilin. Numerical Methods for Extremum Problems.\u2013M., Nauka, 1975, 319 p."},{"issue":"4","key":"19_CR27","first-page":"857","volume":"20","author":"SV Rzhevskij","year":"1969","unstructured":"S. V. Rzhevskij. About a Unified Approach to Solution of Unconditional Minimization Problems. - J. Vychisl. Matem. i Matem. Fiziki, 1969, Vol. 20, No. 4, pp. 857\u2013863.","journal-title":"J. Vychisl. Matem. i Matem. Fiziki"},{"issue":"5","key":"19_CR28","first-page":"1126","volume":"21","author":"S. V","year":"1981","unstructured":"S. V. Rzhevskij. e-Subgradient Method of Solution of Convex Programming Problem. - J. Vychisl. Matem. i Matem. Fiziki, Vol. 21, No. 5, 1981, pp. 1126\u20131132.","journal-title":"J. Vychisl. Matem. i Matem. Fiziki"},{"key":"19_CR29","first-page":"95","volume":"1","author":"SV Rzhevskij","year":"1982","unstructured":"S. V. Rzhevskij. Monotone Algorithm of Search for Saddle Point of Nonsmooth Function. - Kibernetika, 1982, No. 1, pp. 95\u201398.","journal-title":"Kibernetika"},{"key":"19_CR30","first-page":"115","volume":"4","author":"VA Skokov","year":"1974","unstructured":"V. A. Skokov. Note on Minimization Methods Using Operation of Space Dilatation. - Kibernetika, 1974, No. 4, pp. 115\u2013117.","journal-title":"Kibernetika"},{"issue":"5","key":"19_CR31","first-page":"1093","volume":"244","author":"LG Khachijan","year":"1979","unstructured":"L. G. Khachijan. Polynomial Algorithm in Linear Programming. - Dokl. AN S.S.S.R., 1979, Vol. 244, No. 5, pp. 1093\u20131096.","journal-title":"Dokl. AN S.S.S.R."},{"issue":"1","key":"19_CR32","first-page":"51","volume":"20","author":"LG Khachijan","year":"1980","unstructured":"L. G. Khachijan. Polynomial Algorithms in Linear Programming. - J. Vychisl. Matem. i Matem. Fiziki, 1980, Vol. 20, No. 1, pp. 51\u201368.","journal-title":"J. Vychisl. Matem. i Matem. Fiziki"},{"doi-asserted-by":"crossref","unstructured":"M. K. Kozlov, S. P. Tarasov, L. G. Khachijan. Polynomial Solvability of Convex Quadratic Programming. - Dokl. AN S.S.S.R., 1979, Vol. 248, No. 5.","key":"19_CR33","DOI":"10.1016\/0041-5553(80)90098-1"},{"unstructured":"N. Z. Shor. Application of Gradient Descent Method for Solution of Network Transportation Problems. In the Book: Notes, Scientific Seminar on Theory and Application of Cybernetics and Operations Research. Nauchn. Sovet po Kibernetika AN U.S.S.R, Kiev, 1962, Issue 1, pp. 9\u201317.","key":"19_CR34"},{"key":"19_CR35","first-page":"98","volume":"3","author":"NZ Shor","year":"1968","unstructured":"N. Z. Shor. Rate of Convergence of Generalized Gradient Descent Method. Kibernetika, 1968, No. 3, pp. 98\u201399.","journal-title":"Kibernetika"},{"key":"19_CR36","first-page":"6","volume":"1","author":"N. Z","year":"1970","unstructured":"N. Z. Shor. Utilization of Space Dilatation Operation in Minimization of Convex Functions. - Kibernetika, 1970, No. 1, pp. 6\u201312.","journal-title":"- Kibernetika"},{"key":"19_CR37","first-page":"80","volume":"2","author":"N. Z","year":"1970","unstructured":"N. Z. Shor. About Rate of Convergence of Method of Generalized Gradient Descent with Space Dilatation. - Kibernetika, 1970, No. 2, pp. 80\u201385.","journal-title":"- Kibernetika"},{"key":"19_CR38","first-page":"51","volume":"3","author":"NZ Shor","year":"1971","unstructured":"N. Z. Shor, N. G. Zhurbenko. Minimization Method Using Operation of Space Dilatation in the Direction of Difference of Two Sequential Gradients. - Kibernetika, 1971, No. 3, pp. 51\u201359.","journal-title":"Minimization Method Using Operation of Space Dilatation in the Direction of Difference of Two Sequential Gradients. - Kibernetika"},{"doi-asserted-by":"crossref","unstructured":"N. Z. Shor, L. P. Shabashova. Solution of Minimax Problems by Generalized Gradient Descent Method with Space Dilatation. - Kibernetika, 1972, No. 1, pp. 82\u2013 88.","key":"19_CR39","DOI":"10.1007\/BF01069138"},{"key":"19_CR40","first-page":"62","volume":"4","author":"NZ Shor","year":"1979","unstructured":"N. Z. Shor, V. I. Gershovich. Family of Algorithms for Solving Problems of Convex Programming. - Kibernetika, 1979, No. 4, pp. 62\u201367.","journal-title":"- Kibernetika"},{"key":"19_CR41","first-page":"65","volume":"4","author":"N. Z","year":"1972","unstructured":"N. Z. Shor. Method of Minimization of Almost Differentiable Functions. - Kibernetika, 1972, No. 4, pp. 65\u201370.","journal-title":"- Kibernetika"},{"key":"19_CR42","first-page":"67","volume":"5","author":"NZ Shor","year":"1981","unstructured":"N. Z. Shor, V. I. Gershovich. About One Modification of Gradient-Type Algorithms with Space Dilatation for Solution of Large-Scale Problems. - Kibernetika, 1981, No. 5, pp. 67\u201370.","journal-title":"- Kibernetika"},{"key":"19_CR43","first-page":"48","volume":"4","author":"N. Z","year":"1975","unstructured":"N. Z. Shor. Convergence of Gradient-Type Method with Space Dilatation in the Direction of Difference of Two Sequential Gradients. - Kibernetika, 1975, No. 4, pp. 48\u201353.","journal-title":"- Kibernetika"},{"key":"19_CR44","first-page":"94","volume":"1","author":"N. Z","year":"1977","unstructured":"N. Z. Shor. Cutting Method with Space Dilatation for Solving Problems of Convex Programming. - Kibernetika, 1977, No. 1, pp. 94\u201395.","journal-title":"- Kibernetika"},{"key":"19_CR45","first-page":"87","volume":"6","author":"N. Z","year":"1977","unstructured":"N. Z. Shor. New Directions in Development of Nonsmooth Optimization Methods. - Kibernetika, 1977, No. 6, pp. 87\u201391.","journal-title":"- Kibernetika"},{"key":"19_CR46","first-page":"200","volume-title":"Shor. Methods of Optimization of Non-Differentiable Functions and Their Applications","author":"N. Z","year":"1979","unstructured":"N. Z. Shor. Methods of Optimization of Non-Differentiable Functions and Their Applications. - Kiev, Naukova Dumka, 1979, 200 p."},{"issue":"2","key":"19_CR47","first-page":"357","volume":"12","author":"DB Judin","year":"1976","unstructured":"D. B. Judin, A. S. Nemirovskij. Evaluation of Information Complexity and Effective Methods for Solving of Complex Extremum Problems. - Ekonomika i Matema- ticheskie Metody, 1976, Vol. 12, Issue 2, pp. 357\u2013369.","journal-title":"- Ekonomika i Matema- ticheskie Metody"},{"issue":"2","key":"19_CR48","first-page":"381","volume":"6","author":"D Agmon","year":"1954","unstructured":"D. Agmon. The Relaxation Method for Linear Inequalities. - Can. J. Math. 1954, Vol. 6, No. 2, pp. 381\u2013392.","journal-title":"J. Math"},{"doi-asserted-by":"crossref","unstructured":"B. Aspvall, G. Shiloach. A Polynomial Time Algorithm for Solving Systems of Linear Inequalities with Two Variables per Inequality. SIAM J. Comput., Vol. 9, No. 4, Nov. 1980.","key":"19_CR49","DOI":"10.1137\/0209063"},{"unstructured":"R. Bland, D. Goldfarb, M. Todd. The Ellipsoid Method: A Survey. Cornell University, Ithaca, New York, Technical Report No. 476, 79 p.","key":"19_CR50"},{"key":"19_CR51","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1090\/S0002-9947-1975-0367131-6","volume":"205","author":"F Clarke","year":"1975","unstructured":"F. Clarke. Generalized Gradients and Applications. - Trans. Amer. Math. Soc., 1975, Vol. 205, pp. 247\u2013262.","journal-title":"Trans. Amer. Math. Soc."},{"doi-asserted-by":"crossref","unstructured":"M. Gr\u00f6tschel, L. Lov\u00e2sz, A. Schrijver. The Ellipsoid Method and its Consequences in Combinatorial optimization. - Combinatorica, 1981, Vol. I, No. 2, pp. 169\u2013197.","key":"19_CR52","DOI":"10.1007\/BF02579273"},{"key":"19_CR53","volume-title":"Febr","author":"M Gr\u00f6tschel","year":"1981","unstructured":"M. Gr\u00f6tschel, L. Lov\u00e2sz, A. Schrijver. Polynomial Algorithms for Perfect Graphs. Report No. 81176-OR, Bonn University, Febr. 1981."},{"issue":"4","key":"19_CR54","first-page":"703","volume":"8","author":"J Kelley","year":"1960","unstructured":"J. Kelley. The \u201cCutting Plane\u201d Method for Solving Convex Programs. - SIAM Journal, 1960, Vol. 8, No. 4, pp. 703\u2013712.","journal-title":"SIAM Journal"},{"unstructured":"B. K\u00f6rte, R. Schr\u00e4der. A Note on Convergence Proofs for Shor-Khachijan Methods. - In \u201cOptimization and Optimal Control\u201d. Lecture Notes in Control and Information Sciences 30, Springer (1980), pp. 51\u201357.","key":"19_CR55"},{"key":"19_CR56","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/BFb0120700","volume":"3","author":"C Lemarechal","year":"1975","unstructured":"C. Lemarechal. An Extension of Davidon Methods to Nondifferentiable Problems. - Math. Program. Study 3, (1975), pp. 95\u2013100.","journal-title":"Math. Program. Study"},{"doi-asserted-by":"crossref","unstructured":"L. Lov\u00e2sz. On the Shannon Capacity of a Graph. IEEE Trans. Inform. Theory 11-25 (1979), pp. 1\u20137.","key":"19_CR57","DOI":"10.1109\/TIT.1979.1055985"},{"key":"19_CR58","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/BF01584235","volume":"21","author":"JF Maurras","year":"1981","unstructured":"J. F. Maurras, K. Truemper, M. Akg\u00fcl. Polynomial Algorithms for a Class of Linear Programs. Math. Progr., 21 (1981), pp. 121\u2013136.","journal-title":"Math. Progr."},{"unstructured":"R. Mifflin. Semismooth and Semiconvex Functions in Constrained Optimization. RR-76-21. HAS A. - Laxenburg, Austria, 1976, 23 p.","key":"19_CR59"},{"key":"19_CR60","first-page":"32","volume-title":"An Algorithm for Constrained Optimization with Semismooth Functions. RR-73-3. IIASA","author":"R Mifflin","year":"1977","unstructured":"R. Mifflin. An Algorithm for Constrained Optimization with Semismooth Functions. RR-73-3. IIASA. - Laxenburg, Austria, 1977, 32 p."},{"issue":"2","key":"19_CR61","first-page":"393","volume":"6","author":"T Motzkin","year":"1954","unstructured":"T. Motzkin, I. Schoenberg. The Relaxation Method for Linear Inequalities. - Can. J. Math., 1954, Vol. 6, No. 2, pp. 393\u2013404.","journal-title":"J. Math."},{"key":"19_CR62","first-page":"265","volume-title":"the Book: Modern Applied Mathematics","author":"R Schr\u00e4der","year":"1982","unstructured":"R. Schr\u00e4der. Ellipsoid Methods. In the Book: Modern Applied Mathematics: Optimization and Operations Research, B. K\u00f6rte (ed.), North-Holland, Amsterdam, 1982, pp. 265\u2013311."},{"issue":"4","key":"19_CR63","first-page":"545","volume":"9","author":"B Schwartz","year":"1978","unstructured":"B. Schwartz. Zur Minimierung konvexer sub differenzierbarer Funktionen \u00fcber dem Rn. Math. Operationsforschung und Statistik, Series Optimization, 1978, 9, No. 4, pp. 545\u2013557.","journal-title":"Series Optimization"},{"key":"19_CR64","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/BFb0120703","volume":"3","author":"P Wolfe","year":"1975","unstructured":"P. Wolfe. A Method of Conjugate Subgradients for Minimizing Nondifferentiable Functions. - Math. Program. Study 3, (1975), pp. 145\u2013173.","journal-title":"Math. Program. Study"},{"key":"19_CR65","first-page":"6","volume-title":"A Bibliography for the Ellipsoid Algorithm. IBM Research Center","author":"P Wolfe","year":"1980","unstructured":"P. Wolfe. A Bibliography for the Ellipsoid Algorithm. IBM Research Center, York-town Heights. New York, 1980, 6 p."}],"container-title":["Mathematical Programming The State of the Art"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-68874-4_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T22:31:17Z","timestamp":1606257077000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-68874-4_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983]]},"ISBN":["9783642688768","9783642688744"],"references-count":65,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-68874-4_19","relation":{},"subject":[],"published":{"date-parts":[[1983]]}}}