Login / Signup
Matching upper bounds on symmetric predicates in quantum communication complexity.
Daiki Suruga
Published in:
CoRR (2023)
Keyphrases
</>
upper bound
worst case
lower bound
tight bounds
communication networks
upper and lower bounds
matching process
lower and upper bounds
computational complexity
matching scheme
learning algorithm
theoretical analysis
communication cost
generalization error
sample complexity
communication technologies