{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T15:45:55Z","timestamp":1762271155735},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540412373"},{"type":"electronic","value":"9783540409922"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-40992-0_16","type":"book-chapter","created":{"date-parts":[[2007,6,13]],"date-time":"2007-06-13T00:01:19Z","timestamp":1181692879000},"page":"209-223","source":"Crossref","is-referenced-by-count":12,"title":["Self-duality of Bounded Monotone Boolean Functions and Related Problems"],"prefix":"10.1007","author":[{"given":"Daya","family":"Ram Gaur","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ramesh","family":"Krishnamurti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,10,19]]},"reference":[{"issue":"3","key":"16_CR1","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1145\/6420.6421","volume":"4","author":"D. Barbara","year":"1986","unstructured":"D. Barbara and H. Garcia-Molina. The vulnerability of vote assignments. ACM Transactions on Computer Systems, 4(3):187\u2013213, Aug. 1986. 209","journal-title":"ACM Transactions on Computer Systems"},{"key":"16_CR2","unstructured":"C. Berge. Graphs and Hypergraphs. North-Holland, 1973. 209, 210"},{"issue":"1","key":"16_CR3","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1006\/inco.1995.1157","volume":"123","author":"J. Bioch","year":"1995","unstructured":"J. Bioch and T. Ibaraki. Complexity of identification and dualization of positive boolean functions. Information and Computation, 123(1):50\u201363, 1995. 209","journal-title":"Information and Computation"},{"key":"16_CR4","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/0012-365X(94)00053-L","volume":"140","author":"J. Bioch","year":"1995","unstructured":"J. Bioch and T. Ibaraki. Decomposition of positive self-dual functions. Discrete Mathematics, 140:23\u201346, 1995. 209","journal-title":"Discrete Mathematics"},{"issue":"9","key":"16_CR5","doi-asserted-by":"publisher","first-page":"905","DOI":"10.1109\/71.466629","volume":"6","author":"J. C. Bioch","year":"1995","unstructured":"J. C. Bioch and T. Ibaraki. Generating and approximating nondominated coteries. IEEE Transactions on parallel and distributed systems, 6(9):905\u2013913, 1995. 209, 210, 213","journal-title":"IEEE Transactions on parallel and distributed systems"},{"key":"16_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1007\/3-540-54945-5_54","volume-title":"International Symposium on Algorithms, Taipei","author":"E. Boros","year":"1991","unstructured":"E. Boros, P.L. Hammer, T. Ibaraki, and K. Kawakami. Identifying 2-monotonic positive boolean functions in polynomial time. In W.L. Hsu and R.C.T. Lee, editors, Springer Lecture Notes in Computer Science557, International Symposium on Algorithms, Taipei, 104\u2013115, 1991. 210"},{"key":"16_CR7","unstructured":"D. Carlos. Polynomial time algorithms for some self-duality problems. In Proceedings of the Italian Conference on Algorithms, March 1997. 209, 222"},{"issue":"6","key":"16_CR8","doi-asserted-by":"publisher","first-page":"1278","DOI":"10.1137\/S0097539793250299","volume":"24","author":"T. Eiter","year":"1995","unstructured":"T. Eiter and G. Gottlob. Identifying the minimum transversals of a hypergraph and related problems. Siam Journal of Computing, 24(6):1278\u20131304, 1995. 209, 210, 222","journal-title":"Siam Journal of Computing"},{"issue":"3","key":"16_CR9","doi-asserted-by":"publisher","first-page":"618","DOI":"10.1006\/jagm.1996.0062","volume":"21","author":"M. L. Fredman","year":"1996","unstructured":"Michael L. Fredman and Leonid Khachiyan. On the complexity of dualization of monotone disjunctive normal forms. Journal of Algorithms, 21(3):618\u2013628, Nov. 1996. 209, 211","journal-title":"Journal of Algorithms"},{"key":"16_CR10","doi-asserted-by":"publisher","first-page":"841","DOI":"10.1145\/4221.4223","volume":"32","author":"H. Garcia-Molina","year":"1985","unstructured":"H. Garcia-Molina and D. Barbara. How to assign votes in a distributed system. Journal of the ACM, 32:841\u2013860, 1985. 209","journal-title":"Journal of the ACM"},{"key":"16_CR11","unstructured":"V. Gurvich and L. Khachiyan. Generating the irredundant conjunctive and disjunctive normal forms of monotone boolean functions. Technical Report LCSR-TR-251, Dept. of Computer Science, Rutgers Univ., Aug. 1995. 209"},{"key":"16_CR12","doi-asserted-by":"crossref","unstructured":"T. Ibaraki and T. Kameda. A boolean theory of coteries. IEEE Transactions on Parallel and Distributed Systems, pages 779\u2013794, 1993. 210","DOI":"10.1109\/71.238300"},{"key":"16_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1007\/3-540-58325-4_196","volume-title":"ISAAC 1994, Algorithms and Computation","author":"K. Makino","year":"1994","unstructured":"K. Makino and T. Ibaraki. The maximum latency and identification of positive boolean functions. In D. Z. Du and X. S. Zhang, editors, ISAAC 1994, Algorithms and Computation, volume 834 of Springer Lecture Notes in Computer Science, pages 324\u2013332. 210"},{"key":"16_CR14","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/0022-0000(86)90015-2","volume":"22","author":"H. Mannila","year":"1986","unstructured":"H. Mannila and K. J. R\u00e4ih\u00e4. An application of armstrong relations. Journal of Computer and System Science, 22:126\u2013141, 1986. 209","journal-title":"Journal of Computer and System Science"},{"key":"16_CR15","unstructured":"C. Papadimitriou. Computational Complexity. Addison Wesley, 1994. 210"},{"issue":"95","key":"16_CR16","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0004-3702(87)90062-2","volume":"32","author":"R. Reiter","year":"1987","unstructured":"R. Reiter. A theory of diagnosis from first principles. Artificial Intelligence, 32:57 95, 1987. 209","journal-title":"Artificial Intelligence"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Learning Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-40992-0_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T02:08:21Z","timestamp":1556503701000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-40992-0_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540412373","9783540409922"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-40992-0_16","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}