{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T09:26:21Z","timestamp":1758273981367},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642119279"},{"type":"electronic","value":"9783642119286"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11928-6_10","type":"book-chapter","created":{"date-parts":[[2010,4,7]],"date-time":"2010-04-07T11:21:07Z","timestamp":1270639267000},"page":"138-144","source":"Crossref","is-referenced-by-count":1,"title":["On Links between Concept Lattices and Related Complexity Problems"],"prefix":"10.1007","author":[{"given":"Mikhail A.","family":"Babin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sergei O.","family":"Kuznetsov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","volume-title":"Lattice Theory","author":"G. Birkhoff","year":"1967","unstructured":"Birkhoff, G.: Lattice Theory. Amer. Math. Soc., Providence (1967)"},{"key":"10_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-59830-2","volume-title":"Formal Concept Analysis: Mathematical Foundations","author":"B. Ganter","year":"1999","unstructured":"Ganter, B., Wille, R.: Formal Concept Analysis: Mathematical Foundations. Springer, Berlin (1999)"},{"key":"10_CR3","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/978-3-540-78137-0_15","volume-title":"Formal Concept Analysis","author":"B. Ganter","year":"2008","unstructured":"Ganter, B.: Lattices of Rough Set Abstractions as P-Products. In: Medina, R., Obiedkov, S. (eds.) ICFCA 2008. LNCS (LNAI), vol.\u00a04933, pp. 199\u2013216. Springer, Heidelberg (2008)"},{"key":"10_CR4","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M. Garey","year":"1979","unstructured":"Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)"},{"issue":"4","key":"10_CR5","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1023\/A:1013970520933","volume":"18","author":"S.O. Kuznetsov","year":"2001","unstructured":"Kuznetsov, S.O.: On Computing the Size of a Lattice and Related Decision Problems. Order\u00a018(4), 313\u2013321 (2001)","journal-title":"Order"},{"key":"10_CR6","unstructured":"Kuznetsov, S.O.: On the Intractability of Computing the Duquenne-Guigues Base. Journal of Universal Computer Science\u00a010(8), 927\u2013933"},{"issue":"2-3","key":"10_CR7","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1080\/09528130210164170","volume":"14","author":"S.O. Kuznetsov","year":"2002","unstructured":"Kuznetsov, S.O., Obiedkov, S.A.: Comparing performance of algorithms for generating concept lattices. J. Exp. Theor. Artif. Intell.\u00a014(2-3), 189\u2013216 (2002)","journal-title":"J. Exp. Theor. Artif. Intell."},{"key":"10_CR8","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/978-3-540-73681-3_18","volume-title":"Conceptual Structures: Knowledge Architectures for Smart Applications","author":"S.O. Kuznetsov","year":"2007","unstructured":"Kuznetsov, S.O., Obiedkov, S.A., Roth, C.: Reducing the Representation Complexity of Lattice-Based Taxonomies. In: Priss, U., Polovina, S., Hill, R. (eds.) ICCS 2007. LNCS (LNAI), vol.\u00a04604, pp. 241\u2013254. Springer, Heidelberg (2007)"},{"key":"10_CR9","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/11671404_6","volume-title":"Formal Concept Analysis","author":"M. Kr\u00f6tzsch","year":"2006","unstructured":"Kr\u00f6tzsch, M., Malik, G.: The Tensor Product as a Lattice of Regular Galois Connections. In: Missaoui, R., Schmidt, J. (eds.) Formal Concept Analysis. LNCS (LNAI), vol.\u00a03874, pp. 89\u2013104. Springer, Heidelberg (2006)"},{"key":"10_CR10","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1007\/978-94-009-7798-3_15","volume-title":"Ordered Sets","author":"R. Wille","year":"1982","unstructured":"Wille, R.: Restructuring Lattice Theory: an Approach Based on Hierarchies of Concepts. In: Rival, I. (ed.) Ordered Sets, pp. 445\u2013470. Reidel, Dordrecht (1982)"},{"key":"10_CR11","series-title":"LNAI","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/3-540-61534-2_2","volume-title":"Conceptual Structures: Knowledge Representations as Interlingua","author":"R. Wille","year":"1996","unstructured":"Wille, R.: Conceptual Structure of Multicontexts. In: Eklund, P., Mann, G.A., Ellis, G. (eds.) ICCS 1996. LNCS (LNAI), vol.\u00a01115, pp. 23\u201339. Springer, Heidelberg (1996)"}],"container-title":["Lecture Notes in Computer Science","Formal Concept Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11928-6_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T12:00:32Z","timestamp":1619784032000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11928-6_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642119279","9783642119286"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11928-6_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}