{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T14:14:22Z","timestamp":1725459262418},"publisher-location":"Berlin\/Heidelberg","reference-count":11,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540133720"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0030324","type":"book-chapter","created":{"date-parts":[[2006,1,25]],"date-time":"2006-01-25T15:19:29Z","timestamp":1138202369000},"page":"416-424","source":"Crossref","is-referenced-by-count":3,"title":["New lower bound for polyhedral membership problem with an application to linear programming"],"prefix":"10.1007","author":[{"given":"Jaroslav","family":"Mor\u00e1vek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pavel","family":"Pudl\u00e1k","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"39_CR1","doi-asserted-by":"crossref","unstructured":"A.C. Yao, R.L. Rivest, On the polyhedral decision problem. Siam J. Comput., Vol. 9, No. 2, May 1980.","DOI":"10.1137\/0209028"},{"key":"39_CR2","first-page":"498","volume":"8","author":"J. Mor\u00e1vek","year":"1972","unstructured":"J. Mor\u00e1vek, A localization problem in geometry and complexity of discrete programming. Kybernetika (Prague) 8: 498\u2013516 (1972).","journal-title":"Kybernetika"},{"key":"39_CR3","first-page":"442","volume":"14","author":"J. Mor\u00e1vek","year":"1969","unstructured":"J. Mor\u00e1vek, On the complexity of discrete programming problems. Aplikace matematiky 14: 442\u2013474 (1969).","journal-title":"Aplikace matematiky"},{"key":"39_CR4","doi-asserted-by":"crossref","first-page":"702","DOI":"10.1016\/0022-247X(70)90154-X","volume":"30","author":"J. Mor\u00e1vek","year":"1970","unstructured":"J. Mor\u00e1vek, A note upon minimal path problem. Journal of Math. Analysis and Appl. 30: 702\u2013717 (1970).","journal-title":"Journal of Math. Analysis and Appl."},{"key":"39_CR5","first-page":"82","volume":"26","author":"J. Mor\u00e1vek","year":"1981","unstructured":"J. Mor\u00e1vek, A geometrical method in combinatorial complexity. Aplikace matematiky 26: 82\u201396 (1981).","journal-title":"Aplikace matematiky"},{"key":"39_CR6","unstructured":"J. Mor\u00e1vek, Decision trees and lower bound for complexity of linear programming, in Graphs and Other Combinatorial Topics. M. Fiedler, Ed., Proc. of the Third Czechoslovak Symposium on Graph Theory, held in Prague, 1982."},{"key":"39_CR7","volume-title":"The localization problem in geometry and Rabin-Spira linear proofs. (Czech)","author":"E. Kalinov\u00e1","year":"1978","unstructured":"E. Kalinov\u00e1, The localization problem in geometry and Rabin-Spira linear proofs. (Czech), M.Sci. thesis, Universitas Carolina, Prague, 1978."},{"issue":"4","key":"39_CR8","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1007\/BF02579459","volume":"1","author":"E. Gy\u00f6ri","year":"1981","unstructured":"E. Gy\u00f6ri, An n-dimensional search problemwith restricted questions. Combinatorica 1(4) (1981) 377\u2013380.","journal-title":"Combinatorica"},{"key":"39_CR9","unstructured":"B. Gr\u00fcnbaum, Convex Polytopes. John Wiley, 1967."},{"issue":"3","key":"39_CR10","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1016\/0020-0190(80)90125-8","volume":"11","author":"D. Avis","year":"1980","unstructured":"D. Avis, Comments on a lower bound for convex hull determination: \"On the \u03a9 (n log n) lower bound for convex hull and maximal vector determination\" by van Emde Boas. Inform. Process. Lett. 11 (1980), No. 3, 126.","journal-title":"Inform. Process. Lett."},{"issue":"3","key":"39_CR11","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1016\/0020-0190(81)90112-5","volume":"12","author":"J.W. Jaromczyk","year":"1981","unstructured":"J.W. Jaromczyk, Linear decision trees are too weak for convex hull problem. Infor. Process. Lett. 12 (1981), No. 3, 138\u2013141.","journal-title":"Infor. Process. Lett."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1984"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0030324.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T22:01:06Z","timestamp":1607551266000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0030324"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540133720"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/bfb0030324","relation":{},"subject":[]}}