{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,19]],"date-time":"2026-01-19T00:57:31Z","timestamp":1768784251502,"version":"3.49.0"},"reference-count":14,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[2003,1]]},"DOI":"10.1016\/s0020-0190(02)00346-0","type":"journal-article","created":{"date-parts":[[2002,12,2]],"date-time":"2002-12-02T14:16:37Z","timestamp":1038838597000},"page":"1-6","source":"Crossref","is-referenced-by-count":24,"title":["Monotone Boolean dualization is in co-NP[log2n]"],"prefix":"10.1016","volume":"85","author":[{"given":"Dimitris J.","family":"Kavvadias","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elias C.","family":"Stavropoulos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(02)00346-0_BIB001","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1007\/PL00008275","article-title":"Molecular computing, bouned nondeterminism, and efficient recursions","volume":"25","author":"Beigel","year":"1999","journal-title":"Algorithmica"},{"key":"10.1016\/S0020-0190(02)00346-0_BIB002","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1006\/inco.1995.1157","article-title":"Complexity of identification and dualization of positive Boolean functions","volume":"123","author":"Bioch","year":"1995","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0020-0190(02)00346-0_BIB003","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/BF02090764","article-title":"Classes of bounded nondeterminism","volume":"23","author":"Diaz","year":"1990","journal-title":"Math. Systems Theory"},{"key":"10.1016\/S0020-0190(02)00346-0_BIB004","series-title":"Proc. of 34th ACM Symposium on Theory of Computing, Montreal, Quebec, Canada","article-title":"New results on monotone dualization and generating hypergraph transversals","author":"Eiter","year":"2002"},{"issue":"6","key":"10.1016\/S0020-0190(02)00346-0_BIB005","doi-asserted-by":"crossref","first-page":"1278","DOI":"10.1137\/S0097539793250299","article-title":"Identifying the minimal transversals of a hypergraph and related problems","volume":"24","author":"Eiter","year":"1995","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0020-0190(02)00346-0_BIB006","doi-asserted-by":"crossref","first-page":"618","DOI":"10.1006\/jagm.1996.0062","article-title":"On the complexity of dualization of monotone disjunctive normal forms","volume":"21","author":"Fredman","year":"1996","journal-title":"J. Algorithms"},{"issue":"2","key":"10.1016\/S0020-0190(02)00346-0_BIB007","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1145\/235767.235769","article-title":"Limited nondeterminism","volume":"27","author":"Goldsmith","year":"1996","journal-title":"ACM SIGACT News"},{"key":"10.1016\/S0020-0190(02)00346-0_BIB008","series-title":"Proc. of 16th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, Tucson, AZ","first-page":"209","article-title":"Data mining, hypergraph transversals, and machine learning","author":"Gunopulos","year":"1997"},{"key":"10.1016\/S0020-0190(02)00346-0_BIB009","series-title":"On generating the irredundent conjunctive and disjunctive normal forms of monotone Boolean functions, Technical Report LCSR-TR-251","author":"Gurvich","year":"1995"},{"key":"10.1016\/S0020-0190(02)00346-0_BIB010","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/0020-0190(88)90065-8","article-title":"On generating all maximal independent sets","volume":"27","author":"Johnson","year":"1988","journal-title":"Inform. Process. Lett."},{"issue":"3\u20134","key":"10.1016\/S0020-0190(02)00346-0_BIB011","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/S0020-0190(00)00023-5","article-title":"Generating all maximal models of a Boolean expression","volume":"74","author":"Kavvadias","year":"2000","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(02)00346-0_BIB012","series-title":"Proc. of 3th International Workshop on Algorithm Engineering (WAE99), London, UK","first-page":"72","article-title":"Evaluation of an algorithm for the transversal hypergraph problem","author":"Kavvadias","year":"1999"},{"key":"10.1016\/S0020-0190(02)00346-0_BIB013","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1137\/0209003","article-title":"Refining nondeterminism in relativized polynomial-time bounded computations","volume":"9","author":"Kintala","year":"1980","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0020-0190(02)00346-0_BIB014","series-title":"Proc. of 24th International Colloquium on Automata, Languages, and Programming, Bologna, Italy","first-page":"2","article-title":"NP-completeness: A retrospective","author":"Papadimitriou","year":"1997"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019002003460?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019002003460?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,2]],"date-time":"2019-04-02T13:59:54Z","timestamp":1554213594000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019002003460"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,1]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,1]]}},"alternative-id":["S0020019002003460"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(02)00346-0","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2003,1]]}}}