On the complexity of interactive proofs with bounded communication (Q293359): Difference between revisions

@@ Property / author @@
-Oded Goldreich
@@ Property / author: Oded Goldreich / rank @@
-Normal rank
@@ Property / author @@
-Johan T. Håstad
@@ Property / author: Johan T. Håstad / rank @@
-Normal rank
@@ Property / author @@
+Oded Goldreich
@@ Property / author: Oded Goldreich / rank @@
+Normal rank
@@ Property / author @@
+Johan T. Håstad
@@ Property / author: Johan T. Håstad / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+Q25
@@ Property / Mathematics Subject Classification ID: 68Q25 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+F20
@@ Property / Mathematics Subject Classification ID: 03F20 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6590750
@@ Property / zbMATH DE Number: 6590750 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+computational complexicity
@@ Property / zbMATH Keywords: computational complexicity / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q56959078
@@ Property / Wikidata QID: Q56959078 / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:293359