Login / Signup
Automating Tree-Like Resolution in Time $n^{o(\log n)}$ Is ETH-Hard.
Susanna F. de Rezende
Published in:
Electron. Colloquium Comput. Complex. (2021)
Keyphrases
</>
tree structure
binary tree
worst case
website
database
conflict detection
consequence finding
tree construction
low resolution
tree structures
index structure
tree models
image resolution
hierarchical structure
relational databases
data structure
high quality
case study
neural network
data sets