On the public citation graph
On the ?log rank?-conjecture in communication complexity
0 signed · 51 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/jgt.3190130413openalex-snapshot
A counterexample to the rank‐coloring conjecture
inferredcites →https://doi.org/10.1007/bf01192527openalex-snapshot
On rank vs. communication complexity
inferredcites →https://doi.org/10.1016/0012-365x(92)90691-8openalex-snapshot
The gap between the chromatic number of a graph and the rank of its adjacency matrix is superlinear
inferredcites →https://doi.org/10.1016/0022-0000(93)90035-uopenalex-snapshot
Communication complexity and combinatorial lattice theory
inferredcites →https://doi.org/10.1090/s0002-9939-1975-0354422-3openalex-snapshot
Whitney Number Inequalities for Geometric Lattices
inferredcites →https://doi.org/10.1145/62212.62228openalex-snapshot
On the communication complexity of graph properties
inferredcites →https://doi.org/10.1145/800070.802208openalex-snapshot
Las Vegas Is better than Determinism in VLSI and Distributed Computing
inferredcites →https://doi.org/10.1145/800135.804414openalex-snapshot
Some complexity questions related to distributive computing(Preliminary Report)
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/jgt.20367openalex-snapshot
On set intersection representations of graphs
inferred← citeshttps://doi.org/10.1002/rsa.20639openalex-snapshot
Testing properties of functions on finite groups
inferred← citeshttps://doi.org/10.1006/jctb.2000.2003openalex-snapshot
Chromatic Number and the 2-Rank of a Graph
inferred← citeshttps://doi.org/10.1007/978-1-4757-6048-4_47openalex-snapshot
Communication Complexity of Functions on Direct Sums
inferred← citeshttps://doi.org/10.1007/978-3-030-42071-0_11openalex-snapshot
Algorithms for NP-Hard Problems via Rank-Related Parameters of Matrices
inferred← citeshttps://doi.org/10.1007/978-3-032-01475-7_8openalex-snapshot
On the Transformation of Two-Way Nondeterministic Finite Automata to Unambiguous Finite Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-02927-1_33openalex-snapshot
Partition Arguments in Multiparty Communication Complexity
inferred← citeshttps://doi.org/10.1007/978-3-642-29344-3_54openalex-snapshot
The Relationship between Inner Product and Counting Cycles
inferred← citeshttps://doi.org/10.1007/978-3-642-39206-1_17openalex-snapshot
Deterministic Single Exponential Time Algorithms for Connectivity Problems Parameterized by Treewidth
inferred← citeshttps://doi.org/10.1007/bf01192527openalex-snapshot
On rank vs. communication complexity
inferred← citeshttps://doi.org/10.1007/s00493-012-2746-4openalex-snapshot
A counterexample to the Alon-Saks-Seymour conjecture and related problems
inferred← citeshttps://doi.org/10.1007/s11856-023-2517-5openalex-snapshot
Around the log-rank conjecture
inferred← citeshttps://doi.org/10.1016/j.ic.2014.12.008openalex-snapshot
Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth
inferred← citeshttps://doi.org/10.1016/j.ipl.2003.09.020openalex-snapshot
The Log-Rank Conjecture and low degree polynomials
inferred← citeshttps://doi.org/10.1016/j.ipl.2018.09.004openalex-snapshot
The corruption bound, log-rank, and communication complexity
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.01.018openalex-snapshot
Partition arguments in multiparty communication complexity
inferred← citeshttps://doi.org/10.1016/s0024-3795(99)00226-8openalex-snapshot
Matrix rank and communication complexity
inferred← citeshttps://doi.org/10.1016/s0065-2458(08)60342-3openalex-snapshot
Communication Complexity
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00062-xopenalex-snapshot
A comparison of two lower-bound methods for communication complexity
inferred← citeshttps://doi.org/10.1109/focs54457.2022.00055openalex-snapshot
Cut Query Algorithms with Star Contraction
inferred← citeshttps://doi.org/10.1109/sfcs.1998.743480openalex-snapshot
The quantum communication complexity of sampling
inferred← citeshttps://doi.org/10.1137/1.9781611973082.2openalex-snapshot
The Streaming Complexity of Cycle Counting, Sorting By Reversals, and Other Problems
inferred← citeshttps://doi.org/10.1137/1.9781611975031.70openalex-snapshot
A Tight Lower Bound for Counting Hamiltonian Cycles via Matrix Rank
inferred← citeshttps://doi.org/10.1137/11085178xopenalex-snapshot
Distributed Verification and Hardness of Distributed Approximation
inferred← citeshttps://doi.org/10.1137/s009753979935476openalex-snapshot
The Quantum Communication Complexity of Sampling
inferred← citeshttps://doi.org/10.1145/1536414.1536479openalex-snapshot
On the complexity of communication complexity
inferred← citeshttps://doi.org/10.1145/1993636.1993686openalex-snapshot
Distributed verification and hardness of distributed approximation
inferred← citeshttps://doi.org/10.1145/2488608.2488646openalex-snapshot
Fast hamiltonicity checking via bases of perfect matchings
inferred← citeshttps://doi.org/10.1145/3148227openalex-snapshot
Fast Hamiltonicity Checking Via Bases of Perfect Matchings
inferred← citeshttps://doi.org/10.1145/333623.333628openalex-snapshot
Classical versus quantum communication complexity
inferred← citeshttps://doi.org/10.1145/3357713.3384264openalex-snapshot
Bipartite TSP in o(1.9999ⁿ) time, assuming quadratic time matrix multiplication
inferred← citeshttps://doi.org/10.1145/3798129.3800904openalex-snapshot
Combinatorial Optimization using Comparison Oracles
inferred← citeshttps://doi.org/10.1561/0400000040openalex-snapshot
Lower Bounds in Communication Complexity
inferred← citeshttps://doi.org/10.1561/9781601982599openalex-snapshot
Lower Bounds in Communication Complexity
inferred← citeshttps://doi.org/10.1587/essfr.10.1_46openalex-snapshot
A Concise Tour of Communication Complexity Theory
inferred← citeshttps://doi.org/10.18297/etd/693openalex-snapshot
Avoiding, pretending, and querying : three combinatorial problems.
inferred← citeshttps://doi.org/10.4230/lipics.approx/random.2021.48openalex-snapshot
On the Robust Communication Complexity of Bipartite Matching
inferred← citeshttps://doi.org/10.48550/arxiv.0909.5684openalex-snapshot
Partition Arguments in Multiparty Communication Complexity
inferred← citeshttps://doi.org/10.48550/arxiv.1102.2932openalex-snapshot
Applications of Monotone Rank to Complexity Theory
inferred← citeshttps://doi.org/10.48550/arxiv.1207.5211openalex-snapshot
Can Quantum Communication Speed Up Distributed Computation?
inferred← citeshttps://doi.org/10.48550/arxiv.1211.1505openalex-snapshot
Solving weighted and counting variants of connectivity problems parameterized by treewidth deterministically in single exponential time
inferred← citeshttps://doi.org/10.48550/arxiv.1403.8106openalex-snapshot
Recent advances on the log-rank conjecture in communication complexity
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.