Login / Signup
Nearly Optimal Time Bounds for kPath in Hypergraphs.
Lior Kamma
Ohad Trabelsi
Published in:
CoRR (2018)
Keyphrases
</>
worst case
upper bound
asymptotically optimal
dynamic programming
tight bounds
optimal design
lower bound
database
optimal solution
optimal cost
upper and lower bounds
optimal strategy
relational databases
data structure
multi agent
search engine
artificial intelligence
data mining