An \(O(nm)\)-time algorithm for computing the dual of a regular Boolean function (Q1327236): Difference between revisions

@@ Property / cites work @@
+Q4773298
@@ Property / cites work: Q4773298 / rank @@
+Normal rank
@@ Property / cites work @@
+A Class of Polynomially Solvable Set-Covering Problems
+Normal rank
@@ Property / cites work @@
+An O(m n) algorithm for regular set-covering problems
+Normal rank
@@ Property / cites work @@
+Dualization of regular Boolean functions
@@ Property / cites work: Dualization of regular Boolean functions / rank @@
+Normal rank
@@ Property / cites work @@
+An Algorithm to Dualize a Regular Switching Function
+Normal rank
@@ Property / cites work @@
+Q3758559
@@ Property / cites work: Q3758559 / rank @@
+Normal rank
@@ Property / cites work @@
+A new polynomial-time algorithm for linear programming
+Normal rank
@@ Property / cites work @@
+Polynomial-time algorithms for regular set-covering and threshold synthesis
+Normal rank
@@ Property / cites work @@
+Q5607242
@@ Property / cites work: Q5607242 / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0166-218x(94)90215-1
+Normal rank
@@ Property / OpenAlex ID @@
+W2056749900
@@ Property / OpenAlex ID: W2056749900 / rank @@
+Normal rank