Login / Signup
Sublinear Time Algorithms and Complexity of Approximate Maximum Matching.
Soheil Behnezhad
Mohammad Roghani
Aviad Rubinstein
Published in:
CoRR (2022)
Keyphrases
</>
optimization problems
optimal policy
evolutionary algorithm
reinforcement learning
maximum matching
worst case
data mining
computational complexity
space complexity
nearest neighbor
theoretical analysis
orders of magnitude
stable set