{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T14:10:49Z","timestamp":1725459049229},"publisher-location":"Berlin\/Heidelberg","reference-count":13,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540156895"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0028808","type":"book-chapter","created":{"date-parts":[[2006,1,25]],"date-time":"2006-01-25T17:15:07Z","timestamp":1138209307000},"page":"242-248","source":"Crossref","is-referenced-by-count":0,"title":["Linear comparison complexity of the n-cube membership problem"],"prefix":"10.1007","author":[{"given":"Mirko","family":"K\u0159iv\u00e1nek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jaroslav","family":"Mor\u00e1vek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"24_CR1","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 problem with restricted questions. Combinatorica 1(4) (1981) 377\u2013380.","journal-title":"Combinatorica"},{"key":"24_CR2","unstructured":"J. Mor\u00e1vek, On the complexity of discrete programming problems. (talk) 6th International Symposium on Math. Programming, Princeton University 1967."},{"key":"24_CR3","unstructured":"J. Mor\u00e1vek, \u00dcber die algorithmische Komplexit\u00e4t des Problems der diskreten Optimierung. 12. Int. Kolloquium, TH Ilmenau, DDR, 1967."},{"key":"24_CR4","first-page":"442","volume":"14","author":"J. Mor\u00e1vek","year":"1969","unstructured":"J. Mor\u00e1vek, On the complexity of disrete programming problems. Aplikace matematiky 14, 1969, 442\u2013474.","journal-title":"Aplikace matematiky"},{"key":"24_CR5","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":"24_CR6","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":"24_CR7","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":"24_CR8","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1007\/BFb0030324","volume":"176","author":"J. Mor\u00e1vek","year":"1984","unstructured":"J. Mor\u00e1vek, P. Pudl\u00e1k, New lower bound for polyhedral membership problem with an application to linear programming. Lecture Notes in Computer Science, Vol. 176, Proceedings of MFCS 1984, pp. 416\u2013424, Springer-Verlag 1984.","journal-title":"Lecture Notes in Computer Science"},{"issue":"3","key":"24_CR9","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."},{"key":"24_CR10","unstructured":"H. Machida, A lower bound on the complexity of knapsack problem. Proceedings of the Seventh I.B.M. Symposium on Mathematical Foundation of Computer Science (1982), 1\u201323."},{"key":"24_CR11","unstructured":"H. Nakayama, T. Nishizeki and N. Saito, Lower bounds for some graph-problems. Journal of Algorithms, to appear."},{"key":"24_CR12","doi-asserted-by":"crossref","first-page":"462","DOI":"10.1145\/361405.361423","volume":"15","author":"I. Pohl","year":"1972","unstructured":"I. Pohl, A sorting problem and its complexity, Comm of the ACM 15(1972), 462\u2013464.","journal-title":"Comm of the ACM"},{"key":"24_CR13","first-page":"557","volume":"5","author":"S.S. Kislicyn","year":"1964","unstructured":"S.S. Kislicyn, O vyd\u011blenii k-go elementa uporjado\u010dennoj sovokupnosti put\u011bm poparnych sravn\u011bnij. Sibirskij mat. \u017eurnal (Siberian Math. Journal), 5, 1964, 557\u2013564.","journal-title":"Sibirskij mat. \u017eurnal (Siberian Math. Journal)"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0028808.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:59:03Z","timestamp":1607551143000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0028808"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540156895"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/bfb0028808","relation":{},"subject":[]}}