{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:29:35Z","timestamp":1725564575177},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540212362"},{"type":"electronic","value":"9783540247494"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24749-4_4","type":"book-chapter","created":{"date-parts":[[2010,9,8]],"date-time":"2010-09-08T19:01:54Z","timestamp":1283972514000},"page":"31-43","source":"Crossref","is-referenced-by-count":3,"title":["The Complexity of Satisfiability Problems over Finite Lattices"],"prefix":"10.1007","author":[{"given":"Bernhard","family":"Schwarz","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","volume-title":"Colloquium Publications","author":"G. Birkhoff","year":"1967","unstructured":"Birkhoff, G.: Lattice Theory. In: Colloquium Publications, vol.\u00a0XXV, American Mathematical Society, Providence (1967)"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Barrington, D.M., McKenzie, P., Moore, C., Tesson, P., Therien, D.: Equation Satisfiability and Program Satisfiability for Finite Monoids. In: Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science, pp. 172\u2013181 (2000)","DOI":"10.1007\/3-540-44612-5_13"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Buss, S.R.: The Boolean formula value problem is in ALOGTIME. In: Proceedings of the 19th Symposium on Theory of Computing, pp. 123\u2013131 (1987)","DOI":"10.1145\/28395.28409"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Cook, S.A.: The complexity of theorem-proving procedures. In: Proceedings of the Third ACM Symposium on Theory of Computing, pp. 151\u2013158 (1971)","DOI":"10.1145\/800157.805047"},{"key":"4_CR5","volume-title":"Computers and Intractability","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability. W. H. Freeman and Company, New York (1979)"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Goldmann, M., Russell, A.: The complexity of solving equations over finite groups. In: Proceedings of the 14th Annual IEEE Conference on Computational Complexity, pp. 80\u201386 (1999)","DOI":"10.1109\/CCC.1999.766266"},{"key":"#cr-split#-4_CR7.1","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Reading (1994);"},{"key":"#cr-split#-4_CR7.2","doi-asserted-by":"crossref","unstructured":"[Ru81] Ruzzo, W.L.: On uniform circuit complexity. Journal of Computer System Sciences 22, 265\u2013383 (1981)","DOI":"10.1016\/0022-0000(81)90038-6"},{"key":"4_CR8","unstructured":"Reith, S., Wagner, K.W.: The Complexity of Problems Defined by Subclasses of Boolean Functions, Technical Report 218, Inst. f\u00fcr Informatik, Univ. W\u00fcrzburg (1999), Available via ftp from http:\/\/www.informatik.uniwuerzburg.de\/reports\/tr.html"},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"Schwarz, B.: The Complexity of Satisfiability Problems over Finite Lattices, Technical Report 314, Institut f\u00fcr Informatik, Universit\u00e4t W\u00fcrzburg (2004), Available via ftp from http:\/\/www.informatik.uni-wuerzburg.de\/reports\/tr.html","DOI":"10.1007\/978-3-540-24749-4_4"}],"container-title":["Lecture Notes in Computer Science","STACS 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24749-4_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,4]],"date-time":"2019-06-04T05:32:35Z","timestamp":1559626355000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24749-4_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540212362","9783540247494"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24749-4_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}