A new theorem in threshold logic and its application to multioperand binary adders (Q4467334): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1080/00207160310001603262
+Normal rank
@@ Property / OpenAlex ID @@
+W2020610525
@@ Property / OpenAlex ID: W2020610525 / rank @@
+Normal rank
@@ Property / cites work @@
+Parity, circuits, and the polynomial-time hierarchy
+Normal rank
@@ Property / cites work @@
+Q5655273
@@ Property / cites work: Q5655273 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of computing symmetric functions using threshold circuits
+Normal rank
@@ Property / cites work @@
+Approximating threshold circuits by rational functions
+Normal rank
@@ Property / cites work @@
+Simulating Threshold Circuits by Majority Circuits
+Normal rank
@@ Property / cites work @@
+On Optimal Depth Threshold Circuits for Multiplication and Related Problems
+Normal rank