The airplane refueling problem is NP-complete and is solvable in polynomial time.
Jinchuan CuiXiaoya LiPublished in: CoRR (2023)
Keyphrases
- np complete
- np hard
- randomly generated
- computational complexity
- constraint satisfaction problems
- pspace complete
- satisfiability problem
- phase transition
- conjunctive queries
- computationally complex
- decision making
- machine learning
- np complete problems
- information systems
- data mining
- neural network
- bounded treewidth
- polynomially solvable
- databases