New Lower Bounds in Merlin-Arthur Communication and Graph Streaming Verification.
Prantar GhoshVihan ShahPublished in: CoRR (2024)
Keyphrases
- lower bound
- upper bound
- min sum
- graph structure
- communication networks
- graph representation
- branch and bound
- random walk
- objective function
- model checking
- graph matching
- structured data
- directed graph
- upper and lower bounds
- real time
- graph theory
- communication systems
- weighted graph
- learning algorithm
- graph theoretic
- graph mining
- communication cost
- data streams
- directed acyclic graph
- worst case
- streaming data
- optimal solution
- vc dimension
- lower and upper bounds
- branch and bound algorithm
- np hard