Recognizing Union-Find Trees is NP-Complete, Even Without Rank Info.
Kitti GelleSzabolcs IvánPublished in: Int. J. Found. Comput. Sci. (2019)
Keyphrases
- np complete
- np hard
- satisfiability problem
- computational complexity
- decision trees
- randomly generated
- conjunctive queries
- bounded treewidth
- constraint satisfaction problems
- pspace complete
- automatic recognition
- tree models
- phase transition
- rank aggregation
- polynomial time complexity
- compact representations
- np complete problems
- databases
- tree construction
- rank order
- tree structures
- data complexity
- desirable properties
- tree structure
- information retrieval systems
- data model
- query processing
- data structure