verified
refreshopen_in_newsharemore_vert
TSP
favorite_border
0
Owned by TokenAngels
timelinePrice Historyexpand_more
local_offerListingsexpand_more
From
Price
Expiration
tocOffersexpand_less
From
Price
Expiration
Make Offer
subjectDetailsexpand_less
Created by 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?

vertical_splitAbout SuperRareexpand_more

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.

ballotChain Infoexpand_more
Contract Address
Token ID
Blockchain
Ethereum
swap_vertTrading Historyexpand_less
Event
Price
From
To
Date
view_moduleMore from this collectionexpand_less