{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T05:28:25Z","timestamp":1743053305232,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662476710"},{"type":"electronic","value":"9783662476727"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-47672-7_68","type":"book-chapter","created":{"date-parts":[[2015,6,19]],"date-time":"2015-06-19T10:07:39Z","timestamp":1434708459000},"page":"834-845","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Comparator Circuits over Finite Bounded Posets"],"prefix":"10.1007","author":[{"given":"Balagopal","family":"Komarath","sequence":"first","affiliation":[]},{"given":"Jayalal","family":"Sarma","sequence":"additional","affiliation":[]},{"given":"K. S.","family":"Sunil","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,6,20]]},"reference":[{"key":"68_CR1","doi-asserted-by":"crossref","unstructured":"Arora, S., Barak, B.: Computational Complexity: A Modern Approach. Cambridge University Press (2009)","DOI":"10.1017\/CBO9780511804090"},{"issue":"4","key":"68_CR2","doi-asserted-by":"publisher","first-page":"15:1","DOI":"10.1145\/2635822","volume":"6","author":"SA Cook","year":"2014","unstructured":"Cook, S.A., Filmus, Y., L\u00ea, D.T.M.: The complexity of the comparator circuit value problem. ACM Trans. Comput. Theory 6(4), 15:1\u201315:44 (2014)","journal-title":"ACM Trans. Comput. Theory"},{"key":"68_CR3","volume-title":"Introduction to lattices and order","author":"BA Davey","year":"1990","unstructured":"Davey, B.A., Priestley, H.A.: Introduction to lattices and order. Cambridge University Press, Cambridge (1990)"},{"issue":"2","key":"68_CR4","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1016\/0022-0000(92)90024-D","volume":"44","author":"EW Mayr","year":"1992","unstructured":"Mayr, E.W., Subramanian, A.: The complexity of circuit value and network stability. J. Comput. Syst. Sci. 44(2), 302\u2013323 (1992)","journal-title":"J. Comput. Syst. Sci."},{"key":"68_CR5","unstructured":"Spira, P.M.: On time-hardware complexity tradeoffs for boolean functions. In: Proceedings of 4th Hawaii Symp. on System Sciences, pp. 525\u2013527 (1971)"},{"issue":"1","key":"68_CR6","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/BF02482893","volume":"10","author":"P Pudl\u00e1k","year":"1980","unstructured":"Pudl\u00e1k, P., T\u016fma, J.: Every finite lattice can be embedded in a finite partition lattice. algebra universalis 10(1), 74\u201395 (1980)","journal-title":"algebra universalis"},{"key":"68_CR7","unstructured":"Subramanian, A.: The Computational Complexity of the Circuit Value and Network Stability Problems. PhD thesis, Stanford, CA, USA (1990). AAI9102356"},{"key":"68_CR8","first-page":"35","volume":"22","author":"KS Sunil","year":"2015","unstructured":"Sunil, K.S., Komarath, B., Sarma, J.: Comparator circuits over finite bounded posets. Electronic Colloquium on Computational Complexity (ECCC) 22, 35 (2015)","journal-title":"Electronic Colloquium on Computational Complexity (ECCC)"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-47672-7_68","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T02:14:35Z","timestamp":1676945675000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-47672-7_68"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662476710","9783662476727"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-47672-7_68","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"20 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}