Skip to main content
Von hex6c
Von hex6c

The image is a self-portrait depicted using a solution of the Travelling Salesman Problem (TSP). The code has been written in R by Fronkonstin (@aschinchon). The TSP asks the following question: "Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city and returns to the origin city?" TSP is one of the most studied questions in computer science. It is known to be NP-hard, meaning that it is very unlikely that there exists an efficient solution for it. This is in fact related to the most famous open question in computer science, the P vs NP conjecture. It is one of the seven Millennium Prize Problems selected by the Clay Mathematics Institute, each of which carries a US $1,000,000 prize for the first correct solution. Wanna try?

SuperRare collection image

SuperRare makes it easy to create, sell, and collect rare digital art. SuperRare's smart contract platform allows artists to release limited-edition digital artwork tracked on the blockchain, making the pieces rare, verified, and collectible. Filter the crypto art world's best selling works by artist name, creation type, and year of birth on OpenSea.

Kategorie „Art
Vertragsadresse0xb932...b9e0
Token-ID5236
Token-StandardERC-721
ChainEthereum
Erstellergebühren
0%

TSP

visibility
29 Ansichten
  • Preis
    Preis in USD
    Menge
    Ablaufdatum
    Von
  • Preis
    Preis in USD
    Menge
    Differenz zum Mindestpreis
    Ablaufdatum
    Von
keyboard_arrow_down
  • Verkäufe
  • Übertragungen
Ereignis
Preis
Von
An
Datum

TSP

visibility
29 Ansichten
  • Preis
    Preis in USD
    Menge
    Ablaufdatum
    Von
  • Preis
    Preis in USD
    Menge
    Differenz zum Mindestpreis
    Ablaufdatum
    Von
Von hex6c
Von hex6c

The image is a self-portrait depicted using a solution of the Travelling Salesman Problem (TSP). The code has been written in R by Fronkonstin (@aschinchon). The TSP asks the following question: "Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city and returns to the origin city?" TSP is one of the most studied questions in computer science. It is known to be NP-hard, meaning that it is very unlikely that there exists an efficient solution for it. This is in fact related to the most famous open question in computer science, the P vs NP conjecture. It is one of the seven Millennium Prize Problems selected by the Clay Mathematics Institute, each of which carries a US $1,000,000 prize for the first correct solution. Wanna try?

SuperRare collection image

SuperRare makes it easy to create, sell, and collect rare digital art. SuperRare's smart contract platform allows artists to release limited-edition digital artwork tracked on the blockchain, making the pieces rare, verified, and collectible. Filter the crypto art world's best selling works by artist name, creation type, and year of birth on OpenSea.

Kategorie „Art
Vertragsadresse0xb932...b9e0
Token-ID5236
Token-StandardERC-721
ChainEthereum
Erstellergebühren
0%
keyboard_arrow_down
  • Verkäufe
  • Übertragungen
Ereignis
Preis
Von
An
Datum