{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T10:12:25Z","timestamp":1773655945834,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540322030","type":"print"},{"value":"9783540322047","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11671404_21","type":"book-chapter","created":{"date-parts":[[2006,1,23]],"date-time":"2006-01-23T12:03:57Z","timestamp":1138017837000},"page":"306-308","source":"Crossref","is-referenced-by-count":13,"title":["Counting Pseudo-intents and #P-completeness"],"prefix":"10.1007","author":[{"given":"Sergei O.","family":"Kuznetsov","sequence":"first","affiliation":[]},{"given":"Sergei","family":"Obiedkov","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"21_CR1","unstructured":"Ganter, B.: Two Basic Algorithms in Concept Analysis, Preprint Nr. 831, Technische Hochschule Darmstadt (1984)"},{"key":"21_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":"21_CR3","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)"},{"key":"21_CR4","unstructured":"Guigues, J.-L., Duquenne, V.: Informative implications derived from a table of binary data. Preprint, Groupe Math\u00e9matiques et Psychologie, Universit\u00e9 Ren\u00e9 Descartes, Paris (1984)"},{"issue":"95","key":"21_CR5","first-page":"5","volume":"24","author":"J.-L. Guigues","year":"1986","unstructured":"Guigues, J.-L., Duquenne, V.: Familles minimales d\u2019implications informatives r\u00e9sultant d\u2019un tableau de donn\u00e9es binaires. Math. Sci. Hum.\u00a024(95), 5\u201318 (1986)","journal-title":"Math. Sci. Hum."},{"issue":"8","key":"21_CR6","first-page":"927","volume":"10","author":"S.O. Kuznetsov","year":"2004","unstructured":"Kuznetsov, S.O.: On the Intractability of Computing the Duquenne-Guigues Base. Journal of Universal Computer Science\u00a010(8), 927\u2013933 (2004)","journal-title":"Journal of Universal Computer Science"},{"issue":"3","key":"21_CR7","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1137\/0208032","volume":"8","author":"L.G. Valiant","year":"1979","unstructured":"Valiant, L.G.: The Complexity of Enumeration and Reliability Problems. SIAM J. Comput.\u00a08(3), 410\u2013421 (1979)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Formal Concept Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11671404_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:14:17Z","timestamp":1619507657000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11671404_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540322030","9783540322047"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/11671404_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}