Login / Signup
Nondeterministic communication complexity with help and graph functions.
Adi Shraibman
Published in:
Theor. Comput. Sci. (2019)
Keyphrases
</>
wireless networks
structured data
graph theory
worst case
computational complexity
graph representation
weighted graph
communication protocol
random walk
graph model
directed graph
decision problems
polynomial time complexity
bipartite graph
graph matching
data sets
data acquisition
query language
search engine