Isomorphism testing of Boolean functions computable by constant-depth circuits (Q476155): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ic.2014.08.003
+Normal rank
@@ Property / OpenAlex ID @@
+W2064329818
@@ Property / OpenAlex ID: W2064329818 / rank @@
+Normal rank
@@ Property / cites work @@
+The Formula Isomorphism Problem
@@ Property / cites work: The Formula Isomorphism Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Testing Boolean Function Isomorphism
@@ Property / cites work: Testing Boolean Function Isomorphism / rank @@
+Normal rank
@@ Property / cites work @@
+Q5365148
@@ Property / cites work: Q5365148 / rank @@
+Normal rank
@@ Property / cites work @@
+Parity, circuits, and the polynomial-time hierarchy
+Normal rank
@@ Property / cites work @@
+Constant depth circuits, Fourier transform, and learnability
+Normal rank
@@ Property / cites work @@
+Hypergraph isomorphism and structural equivalence of Boolean functions
+Normal rank
@@ Property / cites work @@
+Q2911617
@@ Property / cites work: Q2911617 / rank @@
+Normal rank
@@ Property / cites work @@
+Lower bounds on the size of bounded depth circuits over a complete basis with logical addition
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:476155