Separating counting communication complexity classes (Q5096788): 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.1007/3-540-55210-3_190
+Normal rank
@@ Property / OpenAlex ID @@
+W1510339650
@@ Property / OpenAlex ID: W1510339650 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3359756
@@ Property / cites work: Q3359756 / rank @@
+Normal rank
@@ Property / cites work @@
+Separating complexity classes related to certain input oblivious logarithmic space-bounded Turing machines
+Normal rank
@@ Property / cites work @@
+Q3974873
@@ Property / cites work: Q3974873 / rank @@
+Normal rank
@@ Property / cites work @@
+Lower bounds on the size of bounded depth circuits over a complete basis with logical addition
+Normal rank
@@ Property / cites work @@
+NP is as easy as detecting unique solutions
@@ Property / cites work: NP is as easy as detecting unique solutions / rank @@
+Normal rank