NP-hard

A class of problems for which no known method finds the exact best answer quickly as the problem grows. Routing and scheduling problems are typical examples.

Used in these articles

Related terms

AI and machine learning

• AI agent
• Brain-computer interface
• Combinatorial optimization
• Computer vision
• Context window
• Deep learning
• Domain generalization
• Electroencephalography
• Frontier model
• Hallucination
• Inference
• Large language model
• Machine learning
• Matrix multiplication
• Memristor
• Metaheuristic
• Model drift
• Multiply-accumulate
• Neural network
• Neuromorphic computing
• Operations research
• Quantization
• Reinforcement learning
• Reservoir computing
• Self-play
• Spiking neural network
• SSVEP
• Token
• Training
• Transformer