For every Boolean f, bounded-error quantum and classical deterministic communication complexity of f ∘ AND₂ are polynomially related up to polylog n, both characterized by log of De Morgan sparsity of f.
Quantum Log-Approximate-Rank Conjecture is Also False , booktitle =
5 Pith papers cite this work. Polarity classification is still indexing.
5
Pith papers citing it
verdicts
UNVERDICTED 5representative citing papers
Flutter achieves 2Δ + ε good-case latency for Byzantine Total Order Broadcast via a new binary consensus called Blink, under partial synchrony with 5f+1 servers.
Distillation from frontier VLMs plus E-RLVR regularization produces a 4B local model that achieves 34.5% SR on OVON while cutting inference latency by 82.8%.
Ambulance uses protocol-rigged races among replicas to achieve high throughput and low latency comparable to timeout-based BFT while matching the robustness of cooperative approaches.
A novel MPI-based construction method for spiking neural networks on multi-GPU clusters is introduced, with scaling demonstrated on two cortical models using point-to-point and collective communication.
citing papers explorer
-
Fast Byzantine Total Order Broadcast
Flutter achieves 2Δ + ε good-case latency for Byzantine Total Order Broadcast via a new binary consensus called Blink, under partial synchrony with 5f+1 servers.