Enumerating Minimal Hypotheses and Dualizing Monotone Boolean Functions on Lattices (Q3003407): Difference between revisions

@@ Property / MaRDI profile type @@
+Publication
@@ Property / MaRDI profile type: Publication / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-642-20514-9_5
+Normal rank
@@ Property / OpenAlex ID @@
+W1513865639
@@ Property / OpenAlex ID: W1513865639 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3671128
@@ Property / cites work: Q3671128 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Complexity of Dualization of Monotone Disjunctive Normal Forms
+Normal rank
@@ Property / cites work @@
+Q4230685
@@ Property / cites work: Q4230685 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2754242
@@ Property / cites work: Q2754242 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of learning in concept lattices from positive and negative examples
+Normal rank
@@ Property / cites work @@
+Conceptual Structures for Knowledge Creation and Communication
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:3003407