Login / Signup
On the Node-Averaged Complexity of Locally Checkable Problems on Trees.
Alkida Balliu
Sebastian Brandt
Fabian Kuhn
Dennis Olivetti
Gustav Schmid
Published in:
CoRR (2023)
Keyphrases
</>
decision problems
np complete
problems involving
polynomial hierarchy
benchmark problems
artificial intelligence
information systems
website
relational databases
multi objective
worst case
solving problems
computational issues