{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:08:39Z","timestamp":1760202519775},"publisher-location":"Berlin\/Heidelberg","reference-count":6,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540133720"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0030341","type":"book-chapter","created":{"date-parts":[[2006,1,25]],"date-time":"2006-01-25T10:19:29Z","timestamp":1138184369000},"page":"567-572","source":"Crossref","is-referenced-by-count":7,"title":["A topological view of some problems in complexity theory"],"prefix":"10.1007","author":[{"given":"Michael","family":"Sipser","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"56_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0168-0072(83)90038-6","volume":"24","author":"M. Ajtai","year":"1983","unstructured":"M. Ajtai, \"\u03a3\n                  1\n                  1\n                -formulae on finite structures\", Annals of Pure and Applied Logic 24, 1983, 1\u201348.","journal-title":"Annals of Pure and Applied Logic"},{"key":"56_CR2","doi-asserted-by":"crossref","unstructured":"M. Furst, J.B. Saxe, M. Sipser, \"Parity, circuits, and the polynomial time hierarchy\", Proceedings of the 22nd Annual Symposium on Foundations of Computer Science, 1981, 260\u2013270.","DOI":"10.1109\/SFCS.1981.35"},{"key":"56_CR3","unstructured":"K. Kuratowski, Topology, Academic Press, 1966."},{"key":"56_CR4","unstructured":"Y. Moschavakis, Descriptive Set Theory, North-Holland, 1980."},{"key":"56_CR5","unstructured":"M. Sipser, \"On polynomial versus exponential growth\", unpublished report, 1981."},{"key":"56_CR6","doi-asserted-by":"crossref","unstructured":"M. Sipser, \"Borel sets and circuit complexity\", Proceedings of the 15th Annual Symposium on Theory of Computing, 1983, 61\u201369.","DOI":"10.1145\/800061.808733"}],"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\/BFb0030341.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T17:01:12Z","timestamp":1607533272000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0030341"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540133720"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/bfb0030341","relation":{},"subject":[]}}