Login / Signup
Recognizing k-leaf powers in polynomial time, for constant k.
Manuel Lafond
Published in:
SODA (2022)
Keyphrases
</>
special case
worst case
approximation algorithms
computational complexity
alphabet size
decision trees
reinforcement learning
objective function
data structure
object recognition
finite automata
constant factor