The equivalence of Horn and network complexity for Boolean functions (Q1160604): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Q5639707
@@ Property / cites work: Q5639707 / rank @@
+Normal rank
@@ Property / cites work @@
+Beitrag zur Reduktion des Entscheidungsproblems auf Klassen von Hornformeln mit kurzen Alternationen
+Normal rank
@@ Property / cites work @@
+Complete problems for deterministic polynomial time
+Normal rank
@@ Property / cites work @@
+Q4053629
@@ Property / cites work: Q4053629 / rank @@
+Normal rank
@@ Property / cites work @@
+The network complexity and the Turing machine complexity of finite functions
+Normal rank
@@ Property / cites work @@
+Q3851624
@@ Property / cites work: Q3851624 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5537599
@@ Property / cites work: Q5537599 / rank @@
+Normal rank
@@ Property / cites work @@
+Komplexität von Entscheidungsproblemen. Ein Seminar
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/bf00289267
+Normal rank
@@ Property / OpenAlex ID @@
+W2042029993
@@ Property / OpenAlex ID: W2042029993 / rank @@
+Normal rank