{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T06:48:59Z","timestamp":1775630939593,"version":"3.50.1"},"publisher-location":"Berlin\/Heidelberg","reference-count":6,"publisher":"Springer-Verlag","isbn-type":[{"value":"3540529535","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0029595","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T05:33:46Z","timestamp":1133415226000},"page":"48-60","source":"Crossref","is-referenced-by-count":6,"title":["Interactive computations of optimal solutions"],"prefix":"10.1007","author":[{"given":"Jan","family":"Kraj\u00ed\u010dek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pavel","family":"Pudl\u00e1k","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ji\u0159\u00ed","family":"Sgall","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"L.Babai, Trading group theory for randomness, 17-th STOC, 1985, pp. 421\u2013429.","DOI":"10.1145\/22145.22192"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"S.Goldwasser, S.Michali, C.Rackoff, The knowledge complexity of interactive proof systems, 17-STOC, 1985, pp.291\u2013304.","DOI":"10.1145\/22145.22178"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"R.M.Karp, R.J.Lipton, Some connections between nonuniform and uniform complexity classes, 12-th STOC, 1980, pp.302\u2013309.","DOI":"10.1145\/800141.804678"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"J.Kraj\u00ed\u010dek, P.Pudl\u00e1k, G.Takeuti, Bounded Arithmetic and Polynomial Hierarchy, Annals of Pure an Applied Logic, to appear.","DOI":"10.1016\/0168-0072(91)90043-L"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"M.Krentel, The complexity of optimization problems, 18-th STOC, 1986, pp.69\u201375.","DOI":"10.1145\/12130.12138"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"C.H.Papadimitriou, M.Yannakakis, Optimization, approximation, and complexity classes, 20-th STOC, 1988 pp.229\u2013234.","DOI":"10.1145\/62212.62233"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1990"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0029595","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T08:15:25Z","timestamp":1586592925000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0029595"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540529535"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/bfb0029595","relation":{},"subject":[]}}