BestHub
Sign in
Tag

NP-hard

0 views collected around this technical thread.

Model Perspective
Model Perspective
Mar 5, 2025 · Artificial Intelligence

Can AI Really Crack NP‑Hard Problems? Inside the DeepSeek‑R1 Breakthrough

Researchers from Nanjing University of Aeronautics, Nanjing University of Technology and Oxford show that high‑instruction prompts dramatically boost large language models' mathematical reasoning, enabling DeepSeek‑R1 and Qwen2.5 to solve complex polynomial tasks and even produce a new counterexample to Hilbert's 17th problem.

AIDeepSeekNP-hard
0 likes · 6 min read
Can AI Really Crack NP‑Hard Problems? Inside the DeepSeek‑R1 Breakthrough
Model Perspective
Model Perspective
Nov 22, 2022 · Fundamentals

How to Solve the Traveling Salesman Problem Using Python & NetworkX

This article introduces the classic Traveling Salesman Problem, explains its mathematical formulation, discusses its NP‑hard nature, and demonstrates a practical solution in Python by generating random city coordinates, building a distance graph with NetworkX, applying an approximation algorithm, and visualizing the resulting tour.

NP-hardNetworkXOptimization
0 likes · 6 min read
How to Solve the Traveling Salesman Problem Using Python & NetworkX