Deterministic Communication vs. Partition Number (Q4562279): Difference between revisions

@@ Property / cites work @@
+Separations in query complexity using cheat sheets
+Normal rank
@@ Property / cites work @@
+Separations in Query Complexity Based on Pointer Functions
+Normal rank
@@ Property / cites work @@
+Q5368738
@@ Property / cites work: Q5368738 / rank @@
+Normal rank
@@ Property / cites work @@
+Communication complexity of approximate Nash equilibria
+Normal rank
@@ Property / cites work @@
+SOFSEM 2006: Theory and Practice of Computer Science
+Normal rank
@@ Property / cites work @@
+On the Relative Complexity of Resolution Refinements and Cutting Planes Proof Systems
+Normal rank
@@ Property / cites work @@
+Complexity measures and decision tree complexity: a survey.
+Normal rank
@@ Property / cites work @@
+Approximate Constraint Satisfaction Requires Large LP Relaxations
+Normal rank
@@ Property / cites work @@
+Communication complexity towards lower bounds on circuit depth
+Normal rank
@@ Property / cites work @@
+Q5111142
@@ Property / cites work: Q5111142 / rank @@
+Normal rank
@@ Property / cites work @@
+Rectangles Are Nonnegative Juntas
@@ Property / cites work: Rectangles Are Nonnegative Juntas / rank @@
+Normal rank
@@ Property / cites work @@
+A note on non-deterministic communication complexity with few witnesses
+Normal rank
@@ Property / cites work @@
+On the virtue of succinct proofs
@@ Property / cites work: On the virtue of succinct proofs / rank @@
+Normal rank
@@ Property / cites work @@
+Depth Lower Bounds for Monotone Semi-Unbounded Fan-in Circuits
+Normal rank
@@ Property / cites work @@
+Boolean function complexity. Advances and frontiers.
+Normal rank
@@ Property / cites work @@
+Non-deterministic communication complexity with few witnesses
+Normal rank
@@ Property / cites work @@
+Q5351943
@@ Property / cites work: Q5351943 / rank @@
+Normal rank
@@ Property / cites work @@
+The linear-array conjecture in communication complexity is false
+Normal rank
@@ Property / cites work @@
+Communication Complexity
@@ Property / cites work: Communication Complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Lower Bounds on the Size of Semidefinite Programming Relaxations
+Normal rank
@@ Property / cites work @@
+Recent advances on the log-rank conjecture in communication complexity
+Normal rank
@@ Property / cites work @@
+Towards Better Separation between Deterministic and Randomized Query Complexity
+Normal rank
@@ Property / cites work @@
+On rank vs. communication complexity
@@ Property / cites work: On rank vs. communication complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Separation of the monotone NC hierarchy
@@ Property / cites work: Separation of the monotone NC hierarchy / rank @@
+Normal rank
@@ Property / cites work @@
+The Pattern Matrix Method
@@ Property / cites work: The Pattern Matrix Method / rank @@
+Normal rank
@@ Property / cites work @@
+Q3633949
@@ Property / cites work: Q3633949 / rank @@
+Normal rank
@@ Property / cites work @@
+Expressing combinatorial optimization problems by linear programs
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1137/16m1059369
+Normal rank
@@ Property / OpenAlex ID @@
+W2905458870
@@ Property / OpenAlex ID: W2905458870 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q128730974
@@ Property / Wikidata QID: Q128730974 / rank @@
+Normal rank